Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems

Steiner, Sarah; Radzik, Tomasz

doi:10.1007/3-540-32539-5_59

Sarah Steiner³ &
Tomasz Radzik³

Part of the book series: Operations Research Proceedings ((ORP,volume 2005))

1215 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Chapter: USD 29.95; Price excludes VAT (USA)

eBook: USD 169.00; Price excludes VAT (USA)

Softcover Book: USD 219.99; Price excludes VAT (USA)

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

References

J C N Clímaco and E Q V Martins. A bicriterion shortest path algorithm. European Journal of Operational Research, 11:399–404, 1982.
Article MATH MathSciNet Google Scholar
J M Countinho-Rodrigues, J C N Clímaco, and J R Current. An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Computers & Operations Research, 26:789–798, 1999.
Article Google Scholar
M Ehrgott. Approximation algorithms for combinatorial multicriteria optimization problems. International Transactions in Operational Research, 7:5–31, 2000.
Article MathSciNet Google Scholar
M Ehrgott and X Gandibleux. A survey and annotated bibliography of multiobjective combinatorial optimization. OR Spektrum, 22:425–460, 2000.
MATH MathSciNet Google Scholar
H N Gabow. Two algorithms for generating weighted spanning trees in order. Siam Journal on Computing, 6(1):139–150, 1977.
Article MATH MathSciNet Google Scholar
H W Hamacher and M Queyranne. k best solutions to combinatorial optimization problems. Annals of Operations Research, 4:123–143, 1985.
Article MathSciNet Google Scholar
H W Hamacher and G Ruhe. On spanning tree problems with multiple objectives. Annals of Operations Research, 52:209–230, 1994.
Article MATH MathSciNet Google Scholar
K Melhorn and S Näher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.
Google Scholar
S Steiner and T Radzik. Computing all efficient solutions of the biobjective minimum spanning tree problem. To appear: Computers & Operations Research.
Google Scholar

Download references

Author information

Authors and Affiliations

Dept. of Computer Science, King’s College London, Strand, London, WC2R 2LS
Sarah Steiner & Tomasz Radzik

Authors

Sarah Steiner
View author publications
You can also search for this author in PubMed Google Scholar
Tomasz Radzik
View author publications
You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

Institute of Shipping Economics and Logistics Dept. Logistics Systems, University of Bremen, Universitätsallee GW1 Block A, 28359, Bremen, Germany
Hans-Dietrich Haasis
Faculty of Business Studies and Economics Chair of Logistics, University of Bremen, PO Box 33 04 40, 28334, Bremen, Germany
Herbert Kopfer & Jörn Schönberger &

Rights and permissions

Reprints and permissions

Copyright information

About this paper

Cite this paper

Steiner, S., Radzik, T. (2006). Heuristic Enhancements to the k-best Method for Solving Biobjective Combinatorial Optimisation Problems. In: Haasis, HD., Kopfer, H., Schönberger, J. (eds) Operations Research Proceedings 2005. Operations Research Proceedings, vol 2005. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-32539-5_59

Download citation

DOI: https://doi.org/10.1007/3-540-32539-5_59
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32537-6
Online ISBN: 978-3-540-32539-0
eBook Packages: Business and EconomicsBusiness and Management (R0)

Publish with us

Policies and ethics