Pages that link to "Item:Q3853460"
From MaRDI portal
The following pages link to Theory and algorithms for linear multiple objective programs with zero–one variables (Q3853460):
Displayed 32 items.
- Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem (Q625647) (← links)
- Decision making under uncertainty: A semi-infinite programming approach (Q760341) (← 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)
- An algorithm for the bi-criterion integer programming problem (Q1075952) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- Optimal attribute sets for identifications and diagnoses (Q1090290) (← links)
- Drilling strategies for frontier areas (Q1091084) (← links)
- The R \& D project selection problem with fuzzy coefficients (Q1100092) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- A reference direction approach to multiple objective integer linear programming (Q1130044) (← links)
- Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
- An algorithm for the multiple objective integer linear programming problem (Q1160567) (← links)
- Total unimodularity applications in bi-objective discrete optimization (Q1198627) (← links)
- Multiple criteria decision support -- a review (Q1207533) (← 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 procedure for multiple objective integer linear programming problems (Q1309911) (← links)
- An interactive approach to bicriterion loading of a flexible assembly system (Q1368516) (← links)
- Using DEA to obtain efficient solutions for multi-objective 0--1 linear programs (Q1584813) (← links)
- A fast interactive solution method for large capital expenditure selection problems (Q1610122) (← links)
- Solving zero-one multiple objective programs through implicit enumeration (Q1835586) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- A discussion of scalarization techniques for multiple objective integer programming (Q2379880) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← 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)
- (Q4945108) (← links)
- An algorithm for generalized fuzzy binary linear programming problems (Q5943930) (← links)