Pages that link to "Item:Q4156137"
From MaRDI portal
The following pages link to Linear multiple objective programs with zero–one variables (Q4156137):
Displayed 36 items.
- 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)
- A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs (Q872117) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- On efficient sets in vector maximum problems - A brief survey (Q1068004) (← links)
- Interactive relaxation method for a broad class of integer and continuous nonlinear multiple criteria problems (Q1075943) (← links)
- An algorithm for the bi-criterion integer programming problem (Q1075952) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- Drilling strategies for frontier areas (Q1091084) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- Designing a quality control system in a service organization: A goal programming case study (Q1129891) (← 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)
- Multiple criteria decision support -- a review (Q1207533) (← links)
- Cluster generation and grouping using mathematical programming (Q1255741) (← 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)
- A multi-objective constrained resource information system project selection method (Q1310006) (← links)
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound (Q1577993) (← links)
- A fast interactive solution method for large capital expenditure selection problems (Q1610122) (← 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)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← 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)
- Optimizing a linear function over an integer efficient set (Q2503083) (← links)
- Enumerating the Set of Non-dominated Vectors in Multiple Objective Integer Linear Programming (Q3598043) (← links)
- Theory and algorithms for linear multiple objective programs with zero–one variables (Q3853460) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)
- Multi-criteria integer linear fractional programming problem (Q4351196) (← links)
- An Algorithm For Solving Multiple Objective Integer Linear Programming Problem (Q4457893) (← links)
- Multiobjective 0-1 integer programming for the use of sugarcane residual biomass in energy cogeneration (Q4911457) (← links)
- (Q4945108) (← links)