Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets

DOI10.1287/ijoc.2018.0846zbMath1474.90524OpenAlexW2942148196MaRDI QIDQ5139632

Sune Lauth Gadegaard, Matthias Ehrgott, Lars Relund Nielsen

Publication date: 9 December 2020

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

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/127861/1/IJOCfinal_1.pdf

zbMATH Keywords

combinatorial optimizationbranch-and-cutbi-objective optimizationbi-objective branch-and-cut

Mathematics Subject Classification ID

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

Related Items

Branch-and-Bound for Biobjective Mixed-Integer Linear Programming, Network Models for Multiobjective Discrete Optimization, A decision space algorithm for multiobjective convex quadratic integer optimization, Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs, Branch-and-bound and objective branching with three or more objectives, A matheuristic for tri-objective binary integer linear programming, Optimising makespan and energy consumption in task scheduling for parallel systems

Uses Software

• GitHub
• SSCFLPsolver

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Bound sets for biobjective combinatorial optimization problems
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
• An algorithm for the bi-criterion integer programming problem
• Multiobjective programming and planning
• An algorithm for the multiple objective integer linear programming problem
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem
• Multi-objective branch and bound
• The problem of the optimal biobjective spanning tree
• Multiobjective solution of the uncapacitated plant location problem
• Branching rules revisited
• Two phase algorithms for the bi-objective assignment problem
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
• The Bicriterion Multimodal Assignment Problem: Introduction, Analysis, and Experimental Results
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• An Algorithm for Multiobjective Zero-One Linear Programming
• Bicriteria Transportation Problem
• Multicriteria Optimization