Double description method revisited

  • Komei Fukuda
  • Alain Prodon
Conference paper

DOI: 10.1007/3-540-61576-8_77

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1120)
Cite this paper as:
Fukuda K., Prodon A. (1996) Double description method revisited. In: Deza M., Euler R., Manoussakis I. (eds) Combinatorics and Computer Science. Lecture Notes in Computer Science, vol 1120. Springer, Berlin, Heidelberg

Abstract

The double description method is a simple and useful algorithm for enumerating all extreme rays of a general polyhedral cone in ℝd, despite the fact that we can hardly state any interesting theorems on its time and space complexities. In this paper, we reinvestigate this method, introduce some new ideas for efficient implementations, and show some empirical results indicating its practicality in solving highly degenerate problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1996

Authors and Affiliations

  • Komei Fukuda
    • 1
  • Alain Prodon
    • 2
  1. 1.Institute for Operations ResearchETHZZürichSwitzerland
  2. 2.Department of MathematicsEPFLLausanneSwitzerland

Personalised recommendations