Convex integer maximization via Graver bases
Convex integer maximization via Graver bases
复制标题
通过 Graver 基实现凸整数最大化
DOI:
10.1016/j.jpaa.2008.11.033
复制
发表时间:
2009
影响因子:
0.8
通讯作者:
R. Weismantel
中科院分区:
文献类型:
--
作者:
J. De Loera;R. Hemmecke;Shmul Onn;U. G. Rothblum;R. Weismantel
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on Rdand w1x,…,wdx are linear forms on Rn, This method works for arbitrary input data A,b,d,w1,…,wd,c. Moreover, for fixed d and several important classes of programs in variable dimension, we prove that our algorithm runs in polynomial time. As a consequence, we obtain polynomial time algorithms for various types of multi-way transportation problems, packing problems, and partitioning problems in variable dimension.
登录
查看更多内容
DOI:
--
发表时间:
2001
期刊:
影响因子:
--
作者:
G. Duncan;S. Fienberg;R. Krishnan;R. Padman;S. Roehrig
通讯作者:
S. Roehrig
影响因子:
0.8
作者:
E. Boros;P. Hammer
通讯作者:
P. Hammer
DOI:
--
发表时间:
2004
期刊:
Conference on Integer Programming and Combinatorial Optimization
影响因子:
--
作者:
J. D. Loera;S. Onn
通讯作者:
S. Onn
DOI:
--
发表时间:
2003
期刊:
Australian and New Zealand Journal of Statistics Vol.45
影响因子:
--
作者:
S.Aoki;A.Takemura
通讯作者:
A.Takemura
影响因子:
1.1
作者:
M. Vlach
通讯作者:
M. Vlach