The following pages link to (Q4546412):
Displaying 15 items.
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
- Choquet optimal set in biobjective combinatorial optimization (Q336494) (← links)
- Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Lower bound sets for biobjective shortest path problems (Q905755) (← links)
- A population-based algorithm for solving linear assignment problems with two objectives (Q1652173) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011) (← links)
- On the cardinality of the nondominated set of multi-objective combinatorial optimization problems (Q1949687) (← links)
- B{\&}B method for discrete partial order optimization (Q2010369) (← links)
- Cooperative multiobjective optimization with bounds on objective functions (Q2022239) (← links)
- Bucket elimination for multiobjective optimization problems (Q2506234) (← links)
- Constraint Optimization Techniques for Exact Multi-Objective Optimization (Q3649597) (← links)
- Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
- Relaxations and duality for multiobjective integer programming (Q6608043) (← links)
