Pages that link to "Item:Q4166601"
From MaRDI portal
The following pages link to An Interactive Method as an Aid in Solving Bicriterion Mathematical Programming Problems (Q4166601):
Displaying 12 items.
- An efficient algorithm for the Lagrangean dual of nonlinear knapsack problems with additional nested constraints (Q675985) (← links)
- Interactive multiple objective optimization: Survey. I: Continuous case (Q750284) (← links)
- An integration of efficiency projections into the Geoffrion approach for multiobjective linear programming (Q790048) (← links)
- An interactive method for multiple-objective mathematical programming problems (Q911999) (← links)
- A graphical bicriteria approach to the resource allocation problem (Q1095044) (← links)
- Interactive multidimensional programming models for locational decisions (Q1148217) (← links)
- A comparative study of interactive tradeoff cutting plane methods for MOMP (Q1197943) (← links)
- Interactive bicriterion solution method and its application to critical path method problems (Q1336070) (← links)
- Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1579631) (← links)
- Outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem (Q1908646) (← links)
- A note on bicriterion programming (Q3040940) (← links)
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895) (← links)
