The following pages link to (Q3743134):
Displaying 19 items.
- An interactive algorithm to find the most preferred solution of multi-objective integer programs (Q342783) (← links)
- An interactive approach for biobjective integer programs under quasiconvex preference functions (Q512966) (← links)
- An interactive multiobjective nonlinear programming procedure (Q684339) (← links)
- A new interactive algorithm for multiobjective linear programming using maximally changeable dominance cone (Q684340) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- An interactive algorithm for solving multiple objective integer linear programming problems (Q1342644) (← links)
- Grey integer programming: an application to waste management planning under uncertainty (Q1388852) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- Bi-objective optimisation over a set of convex sub-problems (Q2108798) (← links)
- Multiobjective interval linear programming in admissible-order vector space (Q2215103) (← links)
- Cutting plane method for multiple objective stochastic integer linear programming (Q2569084) (← links)
- (Q3351129) (← links)
- An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions (Q3821927) (← links)
- (Q4363234) (← links)
- (Q4542746) (← links)
