The median tour and maximal covering tour problems: Formulations and heuristics
From MaRDI portal
Publication:1328602
DOI10.1016/0377-2217(94)90149-XzbMATH Open0806.90036WikidataQ58615081 ScholiaQ58615081MaRDI QIDQ1328602FDOQ1328602
Authors: John R. Current, David A. Schilling 
Publication date: 19 February 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
NP-hardheuristic proceduredistributed computer networksbicriterion routing problemsmaximal covering tour problemmedian tour problemrealistically scaled problem
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Transportation, logistics and supply chain management (90B06)
Cites Work
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- The orienteering problem
- The prize collecting traveling salesman problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multiobjective programming and planning
- Title not available (Why is that?)
- The Covering Salesman Problem
- The selective travelling salesman problem
- The shortest path problem with two objective functions
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
- An interactive approach to identify the best compromise solution for two objective shortest path problems
- An Insert/Delete Heuristic for the Travelling Salesman Subset-Tour Problem with One Additional Constraint
Cited In (46)
- Metaheuristics and cooperative approaches for the bi-objective ring star problem
- Metaheuristics for the distance constrained generalized covering traveling salesman problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- An integration of mixed VND and VNS: the case of the multivehicle covering tour problem
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective
- Online covering salesman problem
- The maximum covering/shortest path problem: A multiobjective network design and routing formulation
- Modelling and solving central cycle problems with integer programming.
- An efficient tabu search procedure for the \(p\)-median problem
- Covering part of a planar network
- A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem
- Location of paths on trees with minimal eccentricity and superior section
- General network design: a unified view of combined location and network design problems
- Exact algorithms for budgeted prize-collecting covering subgraph problems
- A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation
- The bi-objective insular traveling salesman problem with maritime and ground transportation costs
- An efficient composite heuristic for the symmetric generalized traveling salesman problem
- Multiobjective routing problems
- A branch-and-cut algorithm for the maximum covering cycle problem
- Algorithms for the metric ring star problem with fixed edge-cost ratio
- Insertion heuristics for central cycle problems
- The bi-objective stochastic covering tour problem
- Multicriteria tour planning for mobile healthcare facilities in a developing country
- The transit route arc-node service maximization problem
- Time constrained maximal covering salesman problem with weighted demands and partial coverage
- A review of extensive facility location in networks
- Strategic route extension in transit networks
- The bi-objective covering tour problem
- Comparing different metaheuristic approaches for the median path problem with bounded length
- A location-or-routing problem with partial and decaying coverage
- A heuristic for the multiple tour maximum collection problem
- Exact and heuristic approaches for the cycle hub location problem
- A flow-based model for the multivehicle covering tour problem with route balancing
- A random-key genetic algorithm for the generalized traveling salesman problem
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- Multi-objective vehicle routing problems
- A data-driven optimization framework for routing mobile medical facilities
- The vehicle routing-allocation problem: A unifying framework
- Locating median cycles in networks
- Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems
- Spatial coverage in routing and path planning problems
- The time constrained maximal covering salesman problem
- Facets of the \(p\)-cycle polytope
- Modeling and solving the two-level generalized median tour problem
- An integer programming-based local search for the covering salesman problem
- Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems
This page was built for publication: The median tour and maximal covering tour problems: Formulations and heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328602)
