Name
Abstract | ||
|---|---|---|
A variable is said semicontinuous if its domain is given by the union of two disjoint nonempty closed intervals. As such, they can be regarded as relaxations of binary or integrality constraints appearing in combinatorial optimization problems. For knapsacks and a class of single-node flow sets, we consider relaxations involving unbounded semicontinuous variables. We analyze the complexity of linear optimization over such relaxations and provide descriptions of their convex hulls in terms of linear inequalities and extended formulations. |
Year | Venue | Field |
|---|---|---|
2016 | COCOA | Discrete mathematics,Combinatorics,Disjoint sets,Combinatorial optimization problem,Computer science,Regular polygon,Linear programming,Linear inequality,Binary number |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
1 | 1 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gustavo Angulo | 1 | 26 | 1.06 |