Pages that link to "Item:Q1158349"
From MaRDI portal
The following pages link to Multicriteria dynamic programming with an application to the integer case (Q1158349):
Displayed 12 items.
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- Optimal stopping problems by two or more decision makers: a survey (Q926553) (← 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)
- Theory and applications of generalized dynamic programming: An overview (Q1119492) (← links)
- An algorithm for the multiple objective integer linear programming problem (Q1160567) (← links)
- An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
- The multiscenario lot size problem with concave costs. (Q1426700) (← links)
- Folk theorems in multicriteria repeated \(N\)-person games. (Q1871421) (← links)
- An improved algorithm for solving biobjective integer programs (Q2379864) (← links)
- (Q4945108) (← links)
- Multiple objectives and non-separability in stochastic dynamic programming (Q5749148) (← links)