Branch-and-bound and objective branching with three or more objectives
From MaRDI portal
Publication:2676405
DOI10.1016/j.cor.2022.106012OpenAlexW4293879931MaRDI QIDQ2676405
Anthony Przybylski, Lars Relund Nielsen, Nicolas Forget, Kathrin Klamroth, Sune Lauth Gadegaard
Publication date: 27 September 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106012
multi-objective combinatorial optimizationbound setsbranch \& boundmulti-objective integer programmingobjective branching
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The \(L\)-shape search method for triobjective integer programming
- On the representation of the search region in multi-objective optimization
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Benson type algorithms for linear vector optimization and applications
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Bound sets for biobjective combinatorial optimization problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- An algorithm for the multiple objective integer linear programming problem
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective 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
- A hybrid approach for biobjective optimization
- Multi-objective branch and bound
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- The problem of the optimal biobjective spanning tree
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Multi-objective integer programming: an improved recursive algorithm
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
- A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
- An Algorithm for Multiobjective Zero-One Linear Programming
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Solving Multiobjective Mixed Integer Convex Optimization Problems
- 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
- Using multiobjective optimization to map the entropy region
