The smoothed number of pareto optimal solutions in bicriteria integer optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4513 LNCS, Issue , 2007, Pages 53-67

  Beier, Rene ^a   Röglin, Heiko ^b   Vöcking, Berthold ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC PROGRAMMING; HEURISTIC METHODS; PARETO PRINCIPLE; PROBLEM SOLVING;

BICRITERIA INTEGER OPTIMIZATION; KNAPSACK PROBLEMS; PARETO OPTIMAL SOLUTIONS; RUNNING TIME;

INTEGER PROGRAMMING;

EID: 38049036822     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72792-7_5     Document Type: Conference Paper

References (16)

1. René Beier. Probabilistic Analysis of Discrete Optimization Problems. PhD thesis, Universität des Saarlandes, 2004.
2. René Beier and Berthold Vöcking. Random knapsack in expected polynomial time. Journal of Computer and System Sciences, 69(3):306-329, 2004.
3. René Beier and Berthold Vöcking. Typical properties of winners and losers in discrete optimization. SIAM Journal on Computing, 35(4):855-881, 2006.
4. H.W. Corley and I.D Moon. Shortest paths in networks with vector weights. Journal of Optimization Theory and Application, 46(1):79-86, 1985.
5. Matthias Ehrgott. Integer solutions of multicriteria network flow problems. Investigacao Operacional, 19:61-73, 1999.
6. Matthias Ehrgott and Xavier Gandibleux. Multiple Criteria Optimization, volume 491 of Lecture Notes in Economics and Mathematical Systems, chapter Multiobjective Combinatorial Optimization. Springer-Verlag, 2000.
7. H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer, Berlin, Germany, 2004.
8. Kathrin Klamroth and Margaret M. Wiecek. Dynamic programming approaches to the multiple criteria knapsack problem. Naval Research Logistics, 47(1):57-76, 2000.
9. Matthias Müller-Hannemann and Karsten Weihe. Pareto shortest paths is often feasible in practice. In Proceedings of the 5th International Workshop on Algorithm Engineering (WAE), pages 185-198, 2001.
10. Adli Mustafa and Mark Goh. Finding integer efficient solutions for bicriteria and tricriteria network flow problems using dinas. Computers & OR, 25(2):139-157, 1998.
11. George L. Nemhauser and Zev Ullmann. Discrete dynamic programming and capital allocation. Management Science, 15:494-505, 1969.
12. Christos H. Papadimitriou and Mihalis Yannakakis. On the approximability of trade-offs and optimal access of web sources. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science (FOCS), pages 86-92. IEEE Computer Society, 2000.
13. Heiko Röglin and Berthold Vöcking. Smoothed analysis of integer programming. In Proceedings of the 11th International Conference on Integer Programming and Combinatorial Optimization (IPCO), volume 3509 of Lecture Notes in Computer Science, pages 276-290. Springer, 2005.
14. Anders J. V. Skriver and Kim Allan Andersen. A label correcting approach for solving bicriterion shortest-path problems. Computers & OR, 27(6):507-524, 2000.
15. Daniel A. Spielman and Shang-Hua Teng. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM, 51(3):385-463, 2004.
16. Sergei Vassilvitskii and Mihalis Yannakakis. Efficiently computing succinct trade-off curves. Theoretical Computer Science, 348(2-3):334-356, 2005.