Pages that link to "Item:Q1309911"
From MaRDI portal
The following pages link to An interactive procedure for multiple objective integer linear programming problems (Q1309911):
Displaying 14 items.
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- Multi-objective optimization over convex disjunctive feasible sets using reference points (Q1278716) (← links)
- A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems (Q1278859) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- An interactive algorithm for solving multiple objective integer linear programming problems (Q1342644) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- An interactive approximation algorithm for multi-objective integer programs (Q1652656) (← links)
- Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems (Q1806944) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program (Q2865174) (← links)
- An integrated approach for stock evaluation and portfolio optimization (Q2903132) (← links)
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration (Q4911457) (← links)
