Lifted Cover Inequalities for 0-1 Integer Programs: Computation

Authors:
Zonghao Gu;George L. Nemhauser;Martin W. P. Savelsbergh
Affiliations:
-;-;-
Venue:
INFORMS Journal on Computing
Year:
1998

Citing 0
Cited 19

Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
General Mixed Integer Programming: Computational Issues for Branch-and-Cut Algorithms

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
Polyhedral Analysis for Concentrator Location Problems

Computational Optimization and Applications
A Branch-and-Cut Procedure for the Multimode Resource-Constrained Project-Scheduling Problem

INFORMS Journal on Computing
A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
On the Exact Separation of Mixed Integer Knapsack Cuts

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem

INFORMS Journal on Computing
Lifting, tilting and fractional programming revisited

Operations Research Letters
Exact solutions to linear programming problems

Operations Research Letters
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting

Discrete Optimization
A polyhedral study on 0-1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting

Discrete Optimization
The submodular knapsack polytope

Discrete Optimization
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities

Discrete Optimization
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements

Discrete Optimization
Simple lifted cover inequalities and hard knapsack problems

Discrete Optimization
An O(nlog n) procedure for identifying facets of the knapsack polytope

Operations Research Letters
Scheduling of scientific workflow in non-dedicated heterogeneous multicluster platform

Journal of Systems and Software
Separation and Extension of Cover Inequalities for Conic Quadratic Knapsack Constraints with Generalized Upper Bounds

INFORMS Journal on Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

We investigate the algorithmic and implementation issues related to the effective and efficient use of lifted cover inequalities and lifted GUB cover inequalities in a branch and cut algorithm for 0脗 1 integer programming. We have tried various strategies on several test problems and we identify the best ones for use in practice.