Branch-and-Bound for Bi-objective Integer Programming

DOI10.1287/ijoc.2018.0856zbMath1474.90417arXiv1809.06823OpenAlexW2889871839WikidataQ127531655 ScholiaQ127531655MaRDI QIDQ5139633

Sophie N. Parragh, Fabien Tricoire

Publication date: 9 December 2020

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

Full work available at URL: https://arxiv.org/abs/1809.06823

zbMATH Keywords

integer programmingbranch-and-boundbranch-and-priceorienteeringbi-objective optimization

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Multi-objective and goal programming (90C29)

Related Items (8)

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 ⋮ An \(\varepsilon \)-constraint column generation-and-enumeration algorithm for bi-objective vehicle routing problems ⋮ 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 ⋮ Optimising makespan and energy consumption in task scheduling for parallel systems ⋮ Equidistant representations: connecting coverage and uniformity in discrete biobjective optimization

Uses Software

• GitHub

Cites Work

• A bi-objective home care scheduling problem: analyzing the trade-off between costs and client inconvenience
• Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• A comparison of stochastic programming and bi-objective optimisation approaches to robust airline crew scheduling
• Bound sets for biobjective combinatorial optimization problems
• Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
• 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
• Fathoming rules for biobjective mixed integer linear programs: review and extensions
• The bi-objective stochastic covering tour problem
• A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method
• A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method
• A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
• A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
• A Computational Study of Exact Approaches for the Bi-Objective Prize-Collecting Steiner Tree Problem
• Diversity Maximization Approach for Multiobjective Optimization
• Bicriteria Transportation Problem
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Multicriteria Optimization
• Column Generation for Bi-Objective Vehicle Routing Problems with a Min-Max Objective
• A Primer in Column Generation
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Branch-and-Bound for Bi-objective Integer Programming