Combinatorics and Computer Science pp 91-111
Double description method revisited
- 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
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.
Unable to display preview. Download preview PDF.