Pages that link to "Item:Q3948895"
From MaRDI portal
The following pages link to Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895):
Displaying 40 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612) (← links)
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- Scenario-based portfolio selection of investment projects with incomplete probability and utility information (Q439347) (← 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)
- Preference programming for robust portfolio modeling and project selection (Q877643) (← links)
- A solution procedure for general knapsack problems with a few constraints (Q908852) (← links)
- Robust portfolio modeling with incomplete cost information and project interdependencies (Q928031) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← 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)
- A class of practical interactive branch and bound algorithms for multicriteria integer programming (Q1075953) (← links)
- Zero-one programming with multiple criteria (Q1077328) (← links)
- Drilling strategies for frontier areas (Q1091084) (← links)
- Algorithms for nonlinear integer bicriterion problems (Q1114597) (← links)
- Theory and applications of generalized dynamic programming: An overview (Q1119492) (← links)
- Single machine sequencing with nonlinear multicriteria cost functions: An application of generalized dynamic programming (Q1185994) (← 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 algorithm for solving multiple objective integer linear programming problems (Q1342644) (← links)
- Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective (Q1616824) (← links)
- On upper approximations of Pareto fronts (Q1630272) (← links)
- Modeling project preferences in multiattribute portfolio decision analysis (Q1695031) (← links)
- Efficient computation of the search region in multi-objective optimization (Q1753505) (← links)
- Multi-objective branch and bound (Q1753506) (← links)
- Scenario-based portfolio model for building robust and proactive strategies (Q1754078) (← links)
- The search-and-remove algorithm for biobjective mixed-integer linear programming problems (Q1754323) (← 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)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- An algorithm for optimizing a linear function over an integer efficient set (Q2378378) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A survey of recent developments in multiobjective optimization (Q2468335) (← links)
- (Q4945108) (← links)
- (Q4963438) (← links)
- Using column generation to compute lower bound sets for bi-objective combinatorial optimization problems (Q5501871) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
- A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising (Q6069770) (← links)
