On a class of mixed-integer sets with a single integer variable

Authors:
Marco Di Summa
Affiliations:
-
Venue:
Operations Research Letters
Year:
2010

Citing 9
Cited 1

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B
Polyhedra for lot-sizing with Wagner-Whitin costs

Mathematical Programming: Series A and B
The Continuous Mixing Polyhedron

Mathematics of Operations Research
Linear-programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity

Mathematical Programming: Series A and B
The Mixing Set with Flows

SIAM Journal on Discrete Mathematics
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Network Formulations of Mixed-Integer Programs

Mathematics of Operations Research

Mixing Sets Linked by Bidirected Paths

SIAM Journal on Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider mixed-integer sets defined by a linear system Ax=b plus an integrality requirement on one variable, where A is a totally unimodular matrix with at most two nonzero entries per row. We give a complete linear-inequality description for the convex hull of any set of this type.