Valid inequalities for 0–1 knapsacks and mips with generalised upper bound constraints

A Polyhedral Study of Integer Variable Upper Bounds

Mathematics of Operations Research

Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics

Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions

Journal of Network and Systems Management

On a stochastic sequencing and scheduling problem

Computers and Operations Research

Integrality gaps of linear and semi-definite programming relaxations for Knapsack

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization

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

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

Discrete Optimization

GUB Covers and Power-Indexed Formulations for Wireless Network Design

Management Science

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

INFORMS Journal on Computing