A polyhedral frobenius theorem with applications to integer optimization

Adjiashvili D, Oertel T, Weismantel R (2015)

Publication Type: Journal article

Publication year: 2015

Journal

SIAM Journal on Discrete Mathematics Society for Industrial and Applied Mathematics

Book Volume: 29

Pages Range: 1287-1302

Journal Issue: 3

DOI: 10.1137/14M0973694

Abstract

Zn, where f is a nonlinear function, P â' Rn is a polyhedron, and W â ZdÃn. As a consequence of our representation theorem, we obtain a general efficient transformation from the latter class of problems to integer linear programming. Our bounds depend polynomially on various important parameters of the input data leading, among others, to first polynomial time algorithms for several classes of nonlinear optimization problems.

Authors with CRIS profile

Timm Oertel

Additional Organisation(s)

Professur für Mathematische Analyse von Daten (Data Analytics)

Involved external institutions

Eidgenössische Technische Hochschule Zürich (ETHZ) / Swiss Federal Institute of Technology in Zurich CH Switzerland (CH)

How to cite

APA:

Adjiashvili, D., Oertel, T., & Weismantel, R. (2015). A polyhedral frobenius theorem with applications to integer optimization. SIAM Journal on Discrete Mathematics, 29(3), 1287-1302. https://dx.doi.org/10.1137/14M0973694

MLA:

Adjiashvili, David, Timm Oertel, and Robert Weismantel. "A polyhedral frobenius theorem with applications to integer optimization." SIAM Journal on Discrete Mathematics 29.3 (2015): 1287-1302.

BibTeX: Download