Pages that link to "Item:Q1806944"
From MaRDI portal
The following pages link to Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944):
Displaying 12 items.
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- A reference point technique to compute nondominated solutions in MOLFP (Q844509) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A note on a decision support system for multiobjective integer and mixed-integer programming problems. (Q1428069) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- Convex preference cone-based approach for many objective optimization problems (Q1652622) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Cone contraction and reference point methods for multi-criteria mixed integer optimization (Q2355896) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Indifference sets of reference points in multi-objective integer linear programming (Q4329624) (← links)
