Pages that link to "Item:Q1328602"

The following pages link to The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602):

Displaying 42 items.

• Covering part of a planar network (Q291695) (← links)
• A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem (Q296861) (← links)
• Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
• The transit route arc-node service maximization problem (Q621660) (← links)
• Strategic route extension in transit networks (Q817558) (← links)
• Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
• A random-key genetic algorithm for the generalized traveling salesman problem (Q858328) (← links)
• The bi-objective covering tour problem (Q868132) (← links)
• Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
• A review of extensive facility location in networks (Q1278421) (← links)
• An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
• Location of paths on trees with minimal eccentricity and superior section (Q1284599) (← links)
• An efficient composite heuristic for the symmetric generalized traveling salesman problem (Q1296792) (← links)
• Modelling and solving central cycle problems with integer programming. (Q1427116) (← links)
• Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
• The time constrained maximal covering salesman problem (Q1631991) (← links)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Exact and heuristic approaches for the cycle hub location problem (Q1686520) (← links)
• Online covering salesman problem (Q1743496) (← links)
• An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
• The bi-objective stochastic covering tour problem (Q1762147) (← links)
• The vehicle routing-allocation problem: A unifying framework (Q1814811) (← links)
• Locating median cycles in networks (Q1887911) (← links)
• Multiobjective routing problems (Q1919112) (← links)
• General network design: a unified view of combined location and network design problems (Q1926688) (← links)
• Algorithms for the metric ring star problem with fixed edge-cost ratio (Q2051906) (← links)
• Spatial coverage in routing and path planning problems (Q2083923) (← links)
• A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
• Exact algorithms for budgeted prize-collecting covering subgraph problems (Q2147080) (← links)
• A data-driven optimization framework for routing mobile medical facilities (Q2196113) (← links)
• A branch-and-cut algorithm for the maximum covering cycle problem (Q2288980) (← links)
• Exact methods for mono-objective and bi-objective multi-vehicle covering tour problems (Q2294623) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← links)
• Insertion heuristics for central cycle problems (Q3057168) (← links)
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
• The Ring Star Problem: Polyhedral analysis and exact algorithm (Q4474293) (← links)
• An integration of mixed VND and VNS: the case of the multivehicle covering tour problem (Q5278232) (← links)
• Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871) (← links)
• Facets of the \(p\)-cycle polytope (Q5946821) (← links)
• A logic-based Benders decomposition solution approach for two covering problems that consider the underlying transportation (Q6068721) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)