An Adaptive Algorithm for Vector Partitioning
暂无分享,去创建一个
Shmuel Onn | Komei Fukuda | Vera Rosta | V. Rosta | K. Fukuda | S. Onn
[1] S. Aviran,et al. Momentopes, the Complexity of Vector Partitioning, and Davenport—Schinzel Sequences , 2002, Discret. Comput. Geom..
[2] Uriel G. Rothblum,et al. Linear-shaped partition problems , 2000, Oper. Res. Lett..
[3] David Avis,et al. Reverse Search for Enumeration , 1996, Discret. Appl. Math..
[4] B. Sturmfels,et al. Cutting Corners , 1999, Food Fights.
[5] U. Rothblum,et al. The Pareto set of the partition bargaining problem , 1991 .
[6] David Avis,et al. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1991, SCG '91.
[7] Artur Andrzejak,et al. Optimization over k-set Polytopes and Efficient k-set Enumeration , 1999, WADS.
[8] Leonard J. Schulman,et al. The Vector Partition Problem for Convex Objective Functions , 2001, Math. Oper. Res..
[9] Uriel G. Rothblum,et al. A Polynomial Time Algorithm for Shaped Partition Problems , 1999, SIAM J. Optim..
[10] Uriel G. Rothblum,et al. Optimal partitions having disjoint convex and conic hulls , 1992, Math. Program..
[11] David Avis,et al. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra , 1992, Discret. Comput. Geom..
[12] Noga Alon,et al. Separable Partitions , 1999, Discret. Appl. Math..
[13] Robert G. Bland,et al. New Finite Pivoting Rules for the Simplex Method , 1977, Math. Oper. Res..