A two-phase method for bi-objective combinatorial optimization and its application to the TSP with profits

MaRDI QIDQ2865889zbMATH OpenFDO

Authors Carlo Filippi

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/20401

zbMATH Keywords

combinatorial optimizationefficient pointstwo-phase methodPareto optimamultiple objective progammingtraveling salesman with profits

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Recommendations

• Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
• An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• scientific article; zbMATH DE number 1975100
• scientific article; zbMATH DE number 915988
• The multiobjective traveling salesman problem: A survey and a new approach

Cited in

(6)

• Speed-up techniques for solving large-scale biobjective TSP
• Bi-objective orienteering for personal activity scheduling
• scientific article; zbMATH DE number 1975100 (Why is no real title available?)
• 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
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits

This page was built for publication: A two-phase method for bi-objective combinatorial optimization and its 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 Q2865889)