FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2023972910> ?p ?o ?g. }

• W2023972910 endingPage "1095" @default.
• W2023972910 startingPage "1083" @default.
• W2023972910 abstract "We consider the problem of identifying a central subgraph of a given simple connected graph. The case where the subgraph comprises a discrete set of vertices is well known. However, the concept of eccentricity can be extended to connected subgraphs such as: paths, trees and cycles. Methods have been reported which deal with the requirement that the subgraph is a path or a constrained tree. We extend this work to the case where the subgraph is required to be a cycle. We report on computational experience with integer programming models of the problems of identifying cycle centres, cycle medians and cycle centroids. The problems have applications in facilities location, particularly the location of emergency facilities, and service facilities. This paper looks at ways of locating a circuit (cycle), such as an inner city rail link or a delivery or collection route, so that all customers wanting to use the link or be near to the delivery or collection route have minimal inconvenience in reaching it. The problem is looked at from a fairly abstract point of view and ways of modelling different types of cycles are considered. These cycles will represent sets of facilities located in a circular structure. Practical applications of the model are considered and discussed. Integer programming models are built of three different cycle problems—the cycle centre problem, the cycle median problem and the cycle centroid problem. The cycle centre problem corresponds to locating a cycle of facilities so the furthest distance travelled by any customer is minimised. The cycle median problem locates the cycle such that it minimises the total distance travelled by all customers and the cycle centroid problem essentially locates the cycle in order to minimise all distances travelled by customers. The models are then tested out on instances of networks that are generated to simulate realistic features of customer location and optimal solutions (optimal cycles) are sought and obtained. Computational experience is reported but it becomes clear that although the exact methods perform adequately on small to medium sized networks they cannot easily solve large instances of the models. For large instances approximate solutions would need to be the fallback position." @default.
• W2023972910 created "2016-06-24" @default.
• W2023972910 creator A5003787332 @default.
• W2023972910 creator A5044970442 @default.
• W2023972910 creator A5078387936 @default.
• W2023972910 date "2004-06-01" @default.
• W2023972910 modified "2023-10-06" @default.
• W2023972910 title "Modelling and solving central cycle problems with integer programming" @default.
• W2023972910 cites W1555798585 @default.
• W2023972910 cites W1968276546 @default.
• W2023972910 cites W1975600022 @default.
• W2023972910 cites W2040896439 @default.
• W2023972910 cites W2085579980 @default.
• W2023972910 cites W2090939957 @default.
• W2023972910 cites W2093935005 @default.
• W2023972910 cites W2102750402 @default.
• W2023972910 cites W2106317547 @default.
• W2023972910 cites W307896644 @default.
• W2023972910 cites W768332614 @default.
• W2023972910 doi "https://doi.org/10.1016/s0305-0548(03)00066-2" @default.
• W2023972910 hasPublicationYear "2004" @default.
• W2023972910 type Work @default.
• W2023972910 sameAs 2023972910 @default.
• W2023972910 citedByCount "7" @default.
• W2023972910 countsByYear W20239729102012 @default.
• W2023972910 countsByYear W20239729102014 @default.
• W2023972910 crossrefType "journal-article" @default.
• W2023972910 hasAuthorship W2023972910A5003787332 @default.
• W2023972910 hasAuthorship W2023972910A5044970442 @default.
• W2023972910 hasAuthorship W2023972910A5078387936 @default.
• W2023972910 hasBestOaLocation W20239729102 @default.
• W2023972910 hasConcept C108005400 @default.
• W2023972910 hasConcept C113174947 @default.
• W2023972910 hasConcept C114614502 @default.
• W2023972910 hasConcept C126255220 @default.
• W2023972910 hasConcept C132525143 @default.
• W2023972910 hasConcept C177264268 @default.
• W2023972910 hasConcept C199360897 @default.
• W2023972910 hasConcept C2777735758 @default.
• W2023972910 hasConcept C33923547 @default.
• W2023972910 hasConcept C41008148 @default.
• W2023972910 hasConcept C42475967 @default.
• W2023972910 hasConcept C56086750 @default.
• W2023972910 hasConcept C80444323 @default.
• W2023972910 hasConcept C97137487 @default.
• W2023972910 hasConceptScore W2023972910C108005400 @default.
• W2023972910 hasConceptScore W2023972910C113174947 @default.
• W2023972910 hasConceptScore W2023972910C114614502 @default.
• W2023972910 hasConceptScore W2023972910C126255220 @default.
• W2023972910 hasConceptScore W2023972910C132525143 @default.
• W2023972910 hasConceptScore W2023972910C177264268 @default.
• W2023972910 hasConceptScore W2023972910C199360897 @default.
• W2023972910 hasConceptScore W2023972910C2777735758 @default.
• W2023972910 hasConceptScore W2023972910C33923547 @default.
• W2023972910 hasConceptScore W2023972910C41008148 @default.
• W2023972910 hasConceptScore W2023972910C42475967 @default.
• W2023972910 hasConceptScore W2023972910C56086750 @default.
• W2023972910 hasConceptScore W2023972910C80444323 @default.
• W2023972910 hasConceptScore W2023972910C97137487 @default.
• W2023972910 hasIssue "7" @default.
• W2023972910 hasLocation W20239729101 @default.
• W2023972910 hasLocation W20239729102 @default.
• W2023972910 hasLocation W20239729103 @default.
• W2023972910 hasOpenAccess W2023972910 @default.
• W2023972910 hasPrimaryLocation W20239729101 @default.
• W2023972910 hasRelatedWork W1979540982 @default.
• W2023972910 hasRelatedWork W2053763405 @default.
• W2023972910 hasRelatedWork W2106269573 @default.
• W2023972910 hasRelatedWork W2362270728 @default.
• W2023972910 hasRelatedWork W2367910502 @default.
• W2023972910 hasRelatedWork W2740820201 @default.
• W2023972910 hasRelatedWork W2922992983 @default.
• W2023972910 hasRelatedWork W3092057765 @default.
• W2023972910 hasRelatedWork W3127504646 @default.
• W2023972910 hasRelatedWork W74652278 @default.
• W2023972910 hasVolume "31" @default.
• W2023972910 isParatext "false" @default.
• W2023972910 isRetracted "false" @default.
• W2023972910 magId "2023972910" @default.
• W2023972910 workType "article" @default.