Pages that link to "Item:Q928691"

The following pages link to Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691):

Displaying 19 items.

• Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems (Q274932) (← links)
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits (Q336534) (← links)
• A bi-objective approach for scheduling ground-handling vehicles in airports (Q342334) (← links)
• An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
• Metaheuristics for the distance constrained generalized covering traveling salesman problem (Q832809) (← links)
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
• Bi-objective orienteering for personal activity scheduling (Q1652268) (← links)
• Exact algorithms for bi-objective ring tree problems with reliability measures (Q1652601) (← links)
• Many-objective Pareto local search (Q1653381) (← links)
• A unified matheuristic for solving multi-constrained traveling salesman problems with profits (Q1707083) (← links)
• Evolution-inspired local improvement algorithm solving orienteering problem (Q2399337) (← links)
• A weighted-sum method for solving the bi-objective traveling thief problem (Q2669668) (← links)
• A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem (Q2815467) (← links)
• Solving a special class of multiple objective linear fractional programming problems (Q2929388) (← links)
• A hybrid heuristic algorithm for single and multi-objective imprecise traveling salesman problems (Q2987911) (← links)
• A two-stage vehicle routing model for large-scale bioterrorism emergencies (Q3057125) (← links)
• From Single-Objective to Multi-Objective Vehicle Routing Problems: Motivations, Case Studies, and Methods (Q3564370) (← links)
• Balancing profits and costs on trees (Q5326788) (← links)
• The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)