A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem

DOI10.1287/ijoc.1110.0476zbMath1462.90120OpenAlexW2101083806MaRDI QIDQ2815467

Nicolas Jozefowiez, Gilbert Laporte, Frédéric Semet

Publication date: 29 June 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1110.0476

zbMATH Keywords

algorithmtraveling salesmancutting planemultiple criteriadecision analysisprogrammingintegernetworks-graphs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items

The multi-objective generalized consistent vehicle routing problem, A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods, Rapid transit network design for optimal cost and origin-destination demand capture, ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design, A hybrid approach for biobjective optimization, Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, Network Models for Multiobjective Discrete Optimization, Split algorithms for multiobjective integer programming problems, Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs, Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming, Disjunctive Programming for Multiobjective Discrete Optimisation, Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets, Branch-and-Bound for Bi-objective Integer Programming, A multi-objective, hub-and-spoke model to design and manage biofuel supply chains, Fathoming rules for biobjective mixed integer linear programs: review and extensions, Multi-objective branch and bound, A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs, A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method, Decomposition of loosely coupled integer programs: a multiobjective perspective

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• The bi-objective covering tour problem
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Bound sets for biobjective combinatorial optimization problems
• 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
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• Two phase algorithms for the bi-objective assignment problem
• A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• Tabu search for a multi-objective routing problem
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• The Colorful Traveling Salesman Problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm