Multiple criteria dynamic programming and multiple knapsack problem
From MaRDI portal
Publication:529961
DOI10.1016/j.amc.2013.12.022zbMath1364.90341OpenAlexW2043893476MaRDI QIDQ529961
Publication date: 9 June 2017
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2013.12.022
Numerical mathematical programming methods (65K05) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Mean value and volume-based sensitivity analysis for Olympic rankings
- Integer programming and combinatoral optimization. 15th international conference, IPCO 2011, New York, NY, USA, June 15--17, 2011. Proceedings
- Dynamic programming with ordered structures: Theory, examples and applications
- Hybrid methods in multi-criteria dynamic programming
- Discrete dynamic programming with outcomes in random variable structures
- Postoptimal analysis in multicriteria linear programming
- Ant algorithms and simulated annealing for multicriteria dynamic programming
- Pareto optimal allocations and dynamic programming
- Dynamic programming in multiplicative lattices
- Standard sensitivity analysis and additive tolerance approach in MOLP
- SENSITIVITY ANALYSIS OF WEAK EFFICIENCY IN MULTIPLE OBJECTIVE LINEAR PROGRAMMING
- Vector-Valued Dynamic Programming
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
This page was built for publication: Multiple criteria dynamic programming and multiple knapsack problem