Augmenting bi-objective branch and bound by scalarization-based information

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
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
An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
A dual variant of Benson's ``outer approximation algorithm for multiple objective linear programming
A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives
Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming
Bound sets for biobjective combinatorial optimization problems
Solving efficiently the 0-1 multi-objective knapsack problem
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
Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
The vector linear program solver Bensolve -- notes on theoretical background
Multi-objective branch and bound
The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs
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
Two phase algorithms for the bi-objective assignment problem
Performance of the MOSA method for the bicriteria assignment problem
An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
Branch-and-bound and objective branching with three or more objectives
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 Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme
A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem
An Exact Algorithm for Finding Extreme Supported Nondominated Points of Multiobjective Mixed Integer Programs
An Algorithm for Multiobjective Zero-One Linear Programming
Output-Sensitive Algorithms for Enumerating the Extreme Nondominated Points of Multiobjective Combinatorial Optimization Problems
Generalized best-first search strategies and the optimality of A*
Bicriteria Transportation Problem
An interactive weighted Tchebycheff procedure for multiple objective programming
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets
Branch-and-Bound for Bi-objective Integer Programming
Multicriteria Optimization