Capacitated facility location: Separation algorithms and computational experience Karen Aardal OriginalPaper Pages: 149 - 175
Minimum cost capacity installation for multicommodity network flows Daniel BienstockSunil ChopraChih-Yang Tsai OriginalPaper Pages: 177 - 199
Cutting planes for integer programs with general integer variables Sebastián CeriaCécile CordierLaurence A. Wolsey OriginalPaper Pages: 201 - 214
A Lagrangian-based heuristic for large-scale set covering problems Sebastián CeriaPaolo NobiliAntonio Sassano OriginalPaper Pages: 215 - 228
The node capacitated graph partitioning problem: A computational study C. E. FerreiraA. MartinL. A. Wolsey OriginalPaper Pages: 229 - 256
Cutting planes for mixed-integer knapsack polyhedra Xiao-Qing YanE. Andrew Boyd OriginalPaper Pages: 257 - 262