Pages that link to "Item:Q1835586"
From MaRDI portal
The following pages link to Solving zero-one multiple objective programs through implicit enumeration (Q1835586):
Displaying 20 items.
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- A review of interactive methods for multiobjective integer and mixed-integer programming (Q869154) (← links)
- Exact algorithm for bi-objective 0-1 knapsack problem (Q990717) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- Drilling strategies for frontier areas (Q1091084) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- A branch and bound algorithm for mixed zero-one multiple objective linear programming (Q1296117) (← links)
- An interactive procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs (Q1584813) (← links)
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs (Q1827646) (← links)
- Solving zero-one multiple objective programs through implicit enumeration (Q1835586) (← 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)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- A method for generating all efficient solutions of 0-1 multi-objective linear programming problem (Q2571939) (← links)
- On some multiobjective optimization problems arising in biology (Q2995503) (← links)
- A METHOD FOR GENERATING ALL THE EFFICIENT SOLUTIONS OF A 0-1 MULTI-OBJECTIVE LINEAR PROGRAMMING PROBLEM (Q4650622) (← links)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration (Q4911457) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
