The Covering Salesman Problem
From MaRDI portal
Publication:4732319
DOI10.1287/trsc.23.3.208zbMath0682.90092WikidataQ58615142 ScholiaQ58615142MaRDI QIDQ4732319
David A. Schilling, John R. Current
Publication date: 1989
Published in: Transportation Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/trsc.23.3.208
90C35: Programming involving graphs or networks
65K05: Numerical mathematical programming methods
90C09: Boolean programming
Related Items
Strategic route extension in transit networks, The bi-objective covering tour problem, Budget constrained minimum cost connected medians, On symmetric subtour problems, A review of extensive facility location in networks, An efficient composite heuristic for the symmetric generalized traveling salesman problem, The median tour and maximal covering tour problems: Formulations and heuristics, Approximation algorithms for the Geometric Covering Salesman Problem, The vehicle routing-allocation problem: A unifying framework, Multiobjective routing problems, Topological design of a two-level network with ring-star configuration, Unnamed Item