The following pages link to (Q4391175):
Displaying 16 items.
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- On the multicriteria allocation problem (Q490242) (← links)
- Hausdorff methods for approximating the convex Edgeworth-Pareto hull in integer problems with monotone objectives (Q519662) (← links)
- Dynamic programming bi-criteria combinatorial optimization (Q777429) (← links)
- A polyhedral approach to solving multicriterion combinatorial optimization problems over sets of polyarrangements (Q1040407) (← links)
- A computational investigation of linear parametrization of criteria in multicriteria discrete programming (Q1264669) (← links)
- Bicriteria assignment problems: Complexity estimates and solution algorithms (Q1390503) (← links)
- Combinatorial optimization problems with two and three criteria (Q1594396) (← links)
- Combinatorial optimization problems in planning and decision making. Theory and applications (Q1727934) (← links)
- On weighting two criteria with a parameter in combinatorial optimization problems (Q1926813) (← links)
- The linear convolution of criteria in the bicriteria traveling salesman problem (Q1975097) (← links)
- MCS---a new algorithm for multicriteria optimisation in constraint programming (Q2379869) (← links)
- Combinatorial optimization. Theory and applications. (Q2574644) (← links)
- The reduction of the Pareto set of a special structure in bicriteria discrete problems (Q5100140) (← links)
- Combinatorial optimization. Theory and algorithms. (Q5894455) (← links)
- Combinatorial optimization. Theory and algorithms. (Q5915481) (← links)
