Branch-and-bound and objective branching with three or more objectives
From MaRDI portal
Publication:2676405
Recommendations
- Multi-objective branch and bound
- Branch and probability bound methods in multi-objective optimization
- Branch-and-bound for bi-objective integer programming
- scientific article; zbMATH DE number 3902394
- Branch-and-bound methods
- A Branch-and-Bound Algorithm for Multiobjective Mixed-integer Convex Optimization
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- scientific article; zbMATH DE number 1149800
- Branch and bound method for multiobjective pairing selection
- Branch and bound algorithms for the multidimensional assignment problem
Cites work
- A branch and bound algorithm for mixed zero-one multiple objective linear programming
- A hybrid approach for biobjective optimization
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems
- An Algorithm for Multiobjective Zero-One Linear Programming
- 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
- Benson type algorithms for linear vector optimization and applications
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Bound sets for biobjective combinatorial optimization problems
- Branch-and-bound for bi-objective integer programming
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming
- Disjunctive Programming for Multiobjective Discrete Optimisation
- Enumeration of the Nondominated Set of Multiobjective Discrete Optimization Problems
- scientific article; zbMATH DE number 1149800 (Why is no real title available?)
- scientific article; zbMATH DE number 915988 (Why is no real title available?)
- Multi-objective branch and bound
- Multi-objective integer programming: an improved recursive algorithm
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case
- On the representation of the search region in multi-objective optimization
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Solving multiobjective mixed integer convex optimization problems
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms
- The \(L\)-shape search method for triobjective integer programming
- The problem of the optimal biobjective spanning tree
- The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
- Using multiobjective optimization to map the entropy region
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs
Cited in
(22)- Multi-objective branch and bound
- Constraint propagation using dominance in interval branch \& bound for nonlinear biobjective optimization
- A general branch-and-bound framework for continuous global multiobjective optimization
- A branch and bound algorithm for Holder bi-objective optimization. Implementation to multidimensional optimization
- A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem
- Constraint optimization techniques for exact multi-objective optimization
- Bi-objective branch-and-cut algorithms based on LP relaxation and bound sets
- Branch-and-bound for bi-objective integer programming
- Bounding fronts in multi-objective combinatorial optimization with application to aesthetic drawing of business process diagrams
- A matheuristic for tri-objective binary integer linear programming
- Limit sets in global multiobjective optimization
- Augmenting bi-objective branch and bound by scalarization-based information
- On the relationship between the value function and the efficient frontier of a mixed integer linear optimization problem
- An outer approximation algorithm for generating the Edgeworth-Pareto hull of multi-objective mixed-integer linear programming problems
- Theory and methodology of time-dependent scheduling: past, present and future
- Engineering and evaluating multi-objective pseudo-Boolean optimizers
- An efficient branch-and-bound algorithm to optimize a function over a nondominated set
- A branch and bound algorithm for continuous multiobjective optimization problems using general ordering cones
- Using dual relaxations in multiobjective mixed-integer convex quadratic programming
- On improvements of multi-objective branch and bound
- Quadratic convex reformulations for multiobjective binary quadratic programming
- Branch and bound method for multiobjective pairing selection
This page was built for publication: Branch-and-bound and objective branching with three or more objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2676405)
