Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
From MaRDI portal
Publication:336534
DOI10.1016/j.cor.2013.02.011zbMath1348.90561OpenAlexW2010908358MaRDI QIDQ336534
Elisa Stevanato, Carlo Filippi
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2013.02.011
Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)
Related Items (7)
A bi-objective approach to discrete cost-bottleneck location problems ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Bi-objective orienteering for personal activity scheduling ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ 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 ⋮ On single-source capacitated facility location with cost and fairness objectives
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
- Generating \(\varepsilon\)-efficient solutions in multiobjective programming
- A heuristic algorithm for master planning that satisfies multiple objectives
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Approximation results for a bicriteria job scheduling problem on a single machine without preemption
- \(\epsilon\)-solutions in vector minimization problems
- Epsilon efficiency
- Existence theorems in vector optimization
- On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
- Epsilon approximate solutions for multiobjective programming problems
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- The biobjective travelling purchaser problem
- Metaheuristics: A bibliography
- Two phase algorithms for the bi-objective assignment problem
- Finding representative systems for discrete bicriterion optimization problems
- A genetic algorithm for a bi-objective capacitated arc routing problem
- Approximation algorithms for the bi-criteria weighted MAX-CUT problem
- Modelling and heuristics of FMS scheduling with multiple objectives
- Efficiently computing succinct trade-off curves
- Approximating Multiobjective Knapsack Problems
- Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- A new approach to the maximum-flow problem
- Finding the set of alternatives in discrete multicriterion problems
- Necessary conditions for ε-optimality
- TSPLIB—A Traveling Salesman Problem Library
- Balancing profits and costs on trees
This page was built for publication: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
