Pages that link to "Item:Q868132"

The following pages link to The bi-objective covering tour problem (Q868132):

Displaying 32 items.

• The bi-objective mixed capacitated general routing problem with different route balance criteria (Q322701) (← links)
• 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)
• Exact hybrid algorithms for solving a bi-objective vehicle routing problem (Q441036) (← links)
• The multi-vehicle probabilistic covering tour problem (Q724092) (← links)
• Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← 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)
• The bi-objective insular traveling salesman problem with maritime and ground transportation costs (Q1653384) (← links)
• Modelling beneficiaries' choice in disaster relief logistics (Q1699124) (← links)
• The bi-objective stochastic covering tour problem (Q1762147) (← links)
• The biobjective travelling purchaser problem (Q1885751) (← 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)
• Two-phase method and Lagrangian relaxation to solve the bi-objective set covering problem (Q2379863) (← links)
• Multi-objective vehicle routing problems (Q2480968) (← links)
• Metaheuristics and cooperative approaches for the bi-objective ring star problem (Q2654392) (← 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)
• Approximating the Pareto frontier for a challenging real-world bi-objective covering problem (Q5883604) (← links)
• A branch-and-bound algorithm based on NSGAII for multi-objective mixed integer nonlinear optimization problems (Q6048167) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)