A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem

DOI10.1287/IJOC.1110.0476zbMATH Open1462.90120OpenAlexW2101083806MaRDI QIDQ2815467FDOQ2815467

Authors: Nicolas Jozefowiez, G. Laporte, F. 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

Recommendations

• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Multi-objective branch and bound
• The multiobjective traveling salesman problem: A survey and a new approach

zbMATH Keywords

algorithmdecision analysisintegermultiple criteriatraveling salesmancutting planeprogrammingnetworks-graphs

Mathematics Subject Classification ID

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

Cites Work

• Multi-objective optimization using evolutionary algorithms
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Title not available (Why is that?)
• Parallel partitioning method (PPM): A new exact method to solve bi-objective problems
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• \(K\)-PPM: a new exact method to solve multi-objective combinatorial optimization problems
• A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
• Tabu search for a multi-objective routing problem
• Bound sets for biobjective combinatorial optimization problems
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• The Colorful Traveling Salesman Problem
• Title not available (Why is that?)
• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
• The bi-objective covering tour problem
• Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
• A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
• A level set method for multiobjective combinatorial optimization: application to the quadratic assignment problem

Cited In (21)

• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
• Decomposition of loosely coupled integer programs: a multiobjective perspective
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
• Relaxations and duality for multiobjective integer programming
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• The multi-objective generalized consistent vehicle routing problem
• A hybrid approach for biobjective optimization
• Network Models for Multiobjective Discrete Optimization
• 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
• Split algorithms for multiobjective integer programming problems
• Adaptation of a branching algorithm to solve the multi-objective Hamiltonian cycle problem
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
• ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
• A multi-objective, hub-and-spoke model to design and manage biofuel supply chains
• Multi-objective branch and bound
• Branch-and-bound for bi-objective integer programming
• Disjunctive Programming for Multiobjective Discrete Optimisation
• A criterion space search algorithm for biobjective integer programming: the balanced box method

This page was built for publication: A generic branch-and-cut algorithm for multiobjective optimization problems: application to the multilabel traveling salesman problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815467)