The following pages link to (Q4387182):
Displaying 11 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- Warm-starting lower bound set computations for branch-and-bound algorithms for multi objective integer linear programs (Q2672116) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Augmenting bi-objective branch and bound by scalarization-based information (Q6616273) (← links)
