Pages that link to "Item:Q868132"
From MaRDI portal
The following pages link to The bi-objective covering tour problem (Q868132):
Displayed 23 items.
- A math-heuristic for the warehouse location-routing problem in disaster relief (Q336848) (← links)
- Dimensionality reduction in multiobjective shortest path search (Q342069) (← links)
- Time constrained maximal covering salesman problem with weighted demands and partial coverage (Q342578) (← links)
- The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
- Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← links)
- The bi-objective stochastic covering tour problem (Q1762147) (← links)
- Spatial coverage in routing and path planning problems (Q2083923) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← 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)
- An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems (Q2669681) (← links)
- A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
- From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
- Health Care Logistics, Emergency Preparedness, and Disaster Relief: New Challenges for Routing Problems with a Focus on the Austrian Situation (Q3564375) (← links)
- A generalized model and a heuristic algorithm for the large-scale covering tour problem (Q4553890) (← 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)
- A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)