Pages that link to "Item:Q1077328"
From MaRDI portal
The following pages link to Zero-one programming with multiple criteria (Q1077328):
Displaying 24 items.
- Robust optimization of the 0-1 knapsack problem: balancing risk and return in assortment optimization (Q322574) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- An approach for solving nonlinear multi-objective separable discrete optimization problem with one constraint (Q706934) (← links)
- Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming (Q814696) (← links)
- Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study (Q853072) (← links)
- 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)
- General communication schemes for multiobjective decision making (Q1075941) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem (Q1174273) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- A multicriteria decision-making approach to university resource allocations and information infrastructure planning (Q1303569) (← 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)
- The multiscenario lot size problem with concave costs. (Q1426700) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- Multiobjective solution of the uncapacitated plant location problem (Q1869487) (← links)
- Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives (Q1877893) (← links)
- Solving the biobjective zero-one knapsack problem by an efficient LP-based heuristic (Q1887952) (← links)
- An improved version of the augmented \(\varepsilon\)-constraint method (AUGMECON2) for finding the exact Pareto set in multi-objective integer programming problems (Q2016277) (← links)
- AXIS: A framework for interactively combining structured algorithms and knowledge based systems (Q2367420) (← links)
- A combined approach to solve binary multicriteria problems (Q3321854) (← links)
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)