Next: About this document ...
Up: listfk1
Previous: listfk1
- 1
-
K. Allemand, K. Fukuda, Th. M. Liebling, and A. Prodon.
The unconstrained quadratic zero one programming.
NSF project in progress, Swiss Federal Institute of Technology,
Lausanne, 1998.
- 2
-
K. Allemand, K. Fukuda, Th. M. Liebling, and E. Steiner.
A polynomial case of unconstrained zero-one quadratic optimization.
Tech. Report, Swiss Federal Institute of Technology, Lausanne,
2000.
presented at the 17th International Symposium on Mathematica
Programming, Atlanta, submitted to Mathematical Programming.
- 3
-
K. Allemand, K. Fukuda, Th. M. Liebling, and E. Steiner.
A polynomial case of unconstrained zero-one quadratic optimization.
Mathematical Programming, Ser. A, 91:49-52, 2001.
- 4
-
A. Andrzejak and K. Fukuda.
Optimization over k-set polytopes and efficient k-set enumeration.
In Proc. 6th International Workshop on Algorithms And Data
Structures (WADS'99), LNCS 1663, pages 1-12. Springer-Verlag, 1999.
- 5
-
D. Avis and K. Fukuda.
A basis enumeration algorithm for linear systems with geometric
applications.
Applied Mathematics Letters, 4(5):39-42, 1991.
- 6
-
D. Avis and K. Fukuda.
A pivoting algorithm for convex hulls and vertex enumeration of
arrangements and polyhedra.
In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 98-104,
1991.
- 7
-
D. Avis and K. Fukuda.
A pivoting algorithm for convex hulls and vertex enumeration of
arrangements and polyhedra.
Discrete Comput. Geom., 8:295-313, 1992.
- 8
-
D. Avis and K. Fukuda.
Reverse search for enumeration.
Tech. Report No. 92-5, Graduate School of Systems Management,
University of Tsukuba, Tokyo, Japan, 1992.
- 9
-
D. Avis and K. Fukuda.
Reverse search for enumeration.
Discrete Applied Mathematics, 65:21-46, 1996.