Convex hulls of superincreasing knapsacks and lexicographic orderings
Author:
- 1 March 2016
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 201, 150-163
Abstract
No abstract availableKeywords
All Related Versions
This publication has 23 references indexed in Scilit:
- Solving Mixed Integer Bilinear Problems Using MILP FormulationsSIAM Journal on Optimization, 2013
- On integer polytopes with few nonzero verticesOperations Research Letters, 2013
- Polyhedral properties for the intersection of two knapsacksMathematical Programming, 2006
- Revlex-initial 0/1-polytopesJournal of Combinatorial Theory, Series A, 2006
- Cover and Pack Inequalities for (Mixed) Integer ProgrammingAnnals of Operations Research, 2005
- Disjunctive programming: Properties of the convex hull of feasible pointsDiscrete Applied Mathematics, 1998
- On variations of the subset sum problemDiscrete Applied Mathematics, 1998
- Partial cover and complete cover inequalitiesOperations Research Letters, 1994
- A characterization of knapsacks with the max-flow-—min-cut propertyOperations Research Letters, 1992
- Sums of lexicographically ordered setsDiscrete Mathematics, 1990