Mirror-Descent Methods in Mixed-Integer Convex Optimization

DOI10.1007/978-3-642-38189-8_5zbMath1317.90207arXiv1209.0686OpenAlexW1545931427MaRDI QIDQ5265166

Timm Oertel, Christian Wagner, Robert Weismantel, Michel Baes

Publication date: 22 July 2015

Published in: Facets of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1209.0686

Mathematics Subject Classification ID

Convex programming (90C25) Mixed integer programming (90C11)

Related Items

Constructing Lattice-Free Gradient Polyhedra in Dimension Two ⋮ Minimizing Cubic and Homogeneous Polynomials over Integers in the Plane ⋮ Constructing lattice-free gradient polyhedra in dimension two