On a biobjective search problem in a line: Formulations and algorithms
暂无分享,去创建一个
Luís Paquete | Kathrin Klamroth | Jochen Gorski | Mathias Jaschob | L. Paquete | K. Klamroth | Jochen Gorski | Mathias Jaschob
[1] M. I. Henig. Vector-Valued Dynamic Programming , 1983 .
[2] T. A. Brown,et al. Dynamic Programming in Multiplicative Lattices , 1965 .
[3] Luís Paquete,et al. Greedy algorithms for a class of knapsack problems with binary weights , 2012, Comput. Oper. Res..
[4] Bernardo Villarreal,et al. Multicriteria integer programming: A (hybrid) dynamic programming recursive approach , 1981, Math. Program..
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] Luís Paquete,et al. On a Cardinality Constrained Multicriteria Knapsack Problem , 2011 .
[7] M. Wiecek,et al. Dynamic programming approaches to the multiple criteria knapsack problem , 2000 .
[8] M. Ehrgott,et al. Connectedness of efficient solutions in multiple criteria combinatorial optimization , 1997 .
[9] Luís Paquete,et al. On Local Search for Bi-objective Knapsack Problems , 2013, Evolutionary Computation.
[10] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .
[11] Matthias Ehrgott,et al. Multicriteria Optimization , 2005 .
[12] Daniel Vanderpooten,et al. Solving efficiently the 0-1 multi-objective knapsack problem , 2009, Comput. Oper. Res..
[13] Yacov Y. Haimes,et al. Multiobjective Decision Making: Theory and Methodology , 1983 .
[14] Kathrin Klamroth,et al. Connectedness of Efficient Solutions in Multiple Objective Combinatorial Optimization , 2011, J. Optim. Theory Appl..
[15] Manbir Sodhi,et al. Stochastic Line Search Using UUVs , 2006, 2006 9th International Conference on Information Fusion.