Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
From MaRDI portal
Publication:336534
Recommendations
- A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Complexity and approximation for traveling salesman problems with profits
- scientific article; zbMATH DE number 1975100
- Single approximation for biobjective max TSP
Cites work
- scientific article; zbMATH DE number 3694968 (Why is no real title available?)
- scientific article; zbMATH DE number 1234104 (Why is no real title available?)
- A genetic algorithm for a bi-objective capacitated arc routing problem
- A heuristic algorithm for master planning that satisfies multiple objectives
- A new approach to the maximum-flow problem
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Approximating multiobjective knapsack problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Balancing profits and costs on trees
- Efficiently computing succinct trade-off curves
- Epsilon approximate solutions for multiobjective programming problems
- Epsilon efficiency
- Existence theorems in vector optimization
- Finding representative systems for discrete bicriterion optimization problems
- Finding the set of alternatives in discrete multicriterion problems
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- Metaheuristics: A bibliography
- Modelling and heuristics of FMS scheduling with multiple objectives
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Necessary conditions for ε-optimality
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Small approximate Pareto sets for biobjective shortest paths and other problems
- TSPLIB—A Traveling Salesman Problem Library
- The biobjective travelling purchaser problem
- Two phase algorithms for the bi-objective assignment problem
- \(\epsilon\)-solutions in vector minimization problems
Cited in
(11)- Balancing profits and costs on trees
- On single-source capacitated facility location with cost and fairness objectives
- Bi-objective orienteering for personal activity scheduling
- A bi-objective approach to discrete cost-bottleneck location problems
- A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits
- Threshold robustness in discrete facility location problems: a bi-objective approach
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Complexity and approximation for traveling salesman problems with profits
This page was built for publication: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336534)
