Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case

DOI10.1016/j.cor.2012.08.003zbMath1349.90006OpenAlexW1975670079MaRDI QIDQ339612

Stefan Ruzika, Florian Seipp, Thomas Vincent, Anthony Przybylski, Xavier Gandibleux

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.08.003

zbMATH Keywords

branch and boundmulti-objective linear programmingdominance filteringmulti-objective mixed integer programmingnondominated set

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Related Items (37)

SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems ⋮ Guided moth-flame optimiser for multi-objective optimization problems ⋮ The \(L\)-shape search method for triobjective integer programming ⋮ An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems ⋮ Heuristic approaches for biobjective mixed 0-1 integer linear programming problems ⋮ The multi-objective generalized consistent vehicle routing problem ⋮ Biobjective robust optimization over the efficient set for Pareto set reduction ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ A multi-objective military system of systems architecting problem with inflexible and flexible systems: formulation and solution methods ⋮ Efficient automated schematic map drawing using multiobjective mixed integer programming ⋮ Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage ⋮ ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design ⋮ An exact algorithm for biobjective mixed integer linear programming problems ⋮ A hybrid approach for biobjective optimization ⋮ Branch-and-Bound for Biobjective Mixed-Integer Linear Programming ⋮ Network Models for Multiobjective Discrete 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 ⋮ Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests ⋮ An exact criterion space search method for a bi-objective nursing home location and allocation problem ⋮ Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming ⋮ Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets ⋮ Branch-and-Bound for Bi-objective Integer Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method ⋮ Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint ⋮ Fathoming rules for biobjective mixed integer linear programs: review and extensions ⋮ Multi-objective branch and bound ⋮ The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs ⋮ A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs ⋮ A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems ⋮ The search-and-remove algorithm for biobjective mixed-integer linear programming problems ⋮ An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method ⋮ GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs ⋮ Bi-objective optimisation over a set of convex sub-problems

Cites Work

• Unnamed Item
• Unnamed Item
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• Bound sets for biobjective combinatorial optimization problems
• Multi-objective integer programming: a general approach for generating all non-dominated solutions
• Zero-one programming with multiple criteria
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• A method for finding the set of non-dominated vectors for multiple objective integer linear programs
• Solving zero-one multiple objective programs through implicit enumeration
• An improved algorithm for solving biobjective integer programs
• Proper efficiency and the theory of vector maximization
• An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
• Theory and algorithms for linear multiple objective programs with zero–one variables
• Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
• The Enumeration of the Set of All Efficient Solutions for a Linear Multiple Objective Program
• Linear multiple objective programs with zero–one variables
• Multicriteria Optimization

This page was built for publication: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case