16

Erratum: Capacitated facility location: Valid inequalities and facets
– K Aardal, Y Pochet, L A Wolsey
 1996

10

On the uncapacitated plant location problem. I: valid inequalities and facets
– D C Cho, E L Johnson, M W Padberg, M R Rao
 1983

302

Maximum matchings and a polyhedron with (0, 1)vertices
– J Edmonds
 1965

20

Capacitated facility location: separation algorithms and computational experience
– Karen Aardal
 1998

9

On the uncapacitated plant location problem. II: facets and lifting theorems
– D C Cho, M W Padberg, M R Rao
 1983

106

Solving largescale zero–one linear programming problems
– H Crowder, E Johnson, M Padberg
 1983

15

Valid inequalities for fixed charge problems
– M W Padberg, T J Van Roy, L A Wolsey
 1985

10

Fractional vertices, cuts and facets of the simple plant location problem
– M Guignard
 1980

6

On the solution of one and twolevel capacitated facility location problems by the cutting plane approach
– K Aardal
 1992

3

Valid inequalities for xed charge problems
– M W Padberg, T J V Roy, L A Wolsey
 1985

20

A comparison of heuristics and relaxations for the capacitated plant location problem
– G Cornuejols, R Sridharan, J Thizy
 1991

23

Functional description of MINTO, a Mixed INTeger Optimizer Version 3.0
– Martin W. P. Savelsbergh, George L. Nemhauser
 1998

3

Valid inequalities, facets and computational experience for the capacitated concentrator location problem
– Q Deng, D SimchiLevi
 1993

59

Capacitated Network Design  Polyhedral Structure and Computation
– Daniel Bienstock, Oktay Günlük
 1994

18

Pulleyblank W: The perfectly matchable subgraph polytope of a bipartite graph. Networks
– E Balas
 1983

122

Lagrangian relaxation for integer programming
– A M Geoffrion
 1974

241

Submodular functions, matroids, and certain polyhedra
– J Edmonds
 1970

100

On the facial structure of set packing polyhedra
– M W Padberg
 1973

22

On the uncapacitated location problem
– G Cornuejols, M Fischer, G Nemhauser
 1977
