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

DOI10.1016/J.COR.2012.08.003zbMATH Open1349.90006OpenAlexW1975670079MaRDI QIDQ339612FDOQ339612

Authors: Thomas Vincent, Florian Seipp, Stefan Ruzika, 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

Recommendations

• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• A branch and bound algorithm for mixed zero-one multiple objective linear programming
• Multi-objective branch and bound
• An Algorithm for Multiobjective Zero-One Linear Programming
• On efficient solutions of 0-1 multi-objective linear programming problems

zbMATH Keywords

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

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

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

Cited In (43)

• Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming
• Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint
• A Criterion Space Method for Biobjective Mixed Integer Programming: The Boxed Line Method
• A criterion space search algorithm for biobjective mixed integer programming: the triangle splitting method
• Guided moth-flame optimiser for multi-objective optimization problems
• SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems
• The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
• Bilevel programming for generating discrete representations in multiobjective optimization
• Addendum to: ``FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
• The search-and-remove algorithm for biobjective mixed-integer linear programming problems
• Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
• A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems
• A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
• An Algorithm for Multiobjective Zero-One Linear Programming
• Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
• The \(L\)-shape search method for triobjective integer programming
• Relaxations and duality for multiobjective integer programming
• Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
• GoNDEF: an exact method to generate all non-dominated points of multi-objective mixed-integer linear programs
• Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
• Heuristic approaches for biobjective mixed 0-1 integer linear programming problems
• The multi-objective generalized consistent vehicle routing problem
• An exact algorithm for biobjective mixed integer linear programming problems
• Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
• Augmenting bi-objective branch and bound by scalarization-based information
• Bi-objective mixed integer linear programming for managing building clusters with a shared electrical energy storage
• Biobjective robust optimization over the efficient set for Pareto set reduction
• A hybrid approach for biobjective optimization
• On efficient solutions of 0-1 multi-objective linear programming problems
• Network Models for Multiobjective Discrete 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
• 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
• Branch-and-bound and objective branching with three or more objectives
• An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems
• Multi-objective branch and bound
• An adaptive patch approximation algorithm for bicriteria convex mixed-integer problems
• An exact criterion space search method for a bi-objective nursing home location and allocation problem
• 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
• Bi-objective optimisation over a set of convex sub-problems

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

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