A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets

DOI10.1007/978-3-642-36694-9_23zbMath1372.90075OpenAlexW140158145MaRDI QIDQ4910822

Diego A. Morán R., Santanu S. Dey

Publication date: 19 March 2013

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36694-9_23

zbMATH Keywords

polynomial-time algorithmclosednessmixed-integer convex programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Closedness of Integer Hulls of Simple Conic Sets

This page was built for publication: A Polynomial-Time Algorithm to Check Closedness of Simple Second Order Mixed-Integer Sets