Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits

DOI10.1016/J.COR.2013.02.011zbMATH Open1348.90561OpenAlexW2010908358MaRDI QIDQ336534FDOQ336534

Authors: Carlo Filippi, Elisa Stevanato 

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

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

zbMATH Keywords

complexityapproximationmulti-objective combinatorial optimizationTSP with profits

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• TSPLIB—A Traveling Salesman Problem Library
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• \(\epsilon\)-solutions in vector minimization problems
• Epsilon approximate solutions for multiobjective programming problems
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Two phase algorithms for the bi-objective assignment problem
• A new approach to the maximum-flow problem
• Title not available (Why is that?)
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• Epsilon efficiency
• Finding representative systems for discrete bicriterion optimization problems
• Title not available (Why is that?)
• Generating \(\varepsilon\)-efficient solutions in multiobjective programming
• Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
• Efficiently computing succinct trade-off curves
• Small approximate Pareto sets for biobjective shortest paths and other problems
• Metaheuristics: A bibliography
• A genetic algorithm for a bi-objective capacitated arc routing problem
• Approximation results for a bicriteria job scheduling problem on a single machine without preemption
• Existence theorems in vector optimization
• On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems.
• The biobjective travelling purchaser problem
• Approximation algorithms for the bi-criteria weighted MAX-CUT problem
• Modelling and heuristics of FMS scheduling with multiple objectives
• Approximating multiobjective knapsack problems
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• Finding the set of alternatives in discrete multicriterion problems
• Necessary conditions for ε-optimality
• Balancing profits and costs on trees
• A heuristic algorithm for master planning that satisfies multiple objectives

Cited In (11)

• Complexity and approximation for traveling salesman problems 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
• On single-source capacitated facility location with cost and fairness objectives
• Bi-objective orienteering for personal activity scheduling
• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• Balancing profits and costs on trees
• 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
• A bi-objective approach to discrete cost-bottleneck location problems

Uses Software

• TSPLIB

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)