The quadratic Graver cone, quadratic integer minimization, and extensions |
| |
Authors: | Jon Lee Shmuel Onn Lyubov Romanchuk Robert Weismantel |
| |
Affiliation: | 1. IOE Department, University of Michigan, Ann Arbor, MI, USA 2. Technion??Israel Institute of Technology, Haifa, Israel 3. ETH Z??rich, Z??rich, Switzerland
|
| |
Abstract: | It has been shown in a number of recent papers that Graver bases methods enable to solve linear and nonlinear integer programming problems in variable dimension in polynomial time, resulting in a variety of applications in operations research and statistics. In this article we continue this line of investigation and show that Graver bases also enable to minimize quadratic and higher degree polynomial functions which lie in suitable cones. These cones always include all separable convex polynomials and typically more. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|