On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2} Egon BalasShu Ming Ng OriginalPaper Pages: 1 - 20
Facets of the balanced (acyclic) induced subgraph polytope Francisco BarahonaAli Ridha Mahjoub OriginalPaper Pages: 21 - 33
Forest covers and a polyhedral intersection theorem A. B. GambleW. R. Pulleyblank OriginalPaper Pages: 49 - 58
A cutting plane algorithm for a clustering problem M. GrötschelY. Wakabayashi OriginalPaper Pages: 59 - 96
A generalization of antiwebs to independence systems and their canonical facets Monique Laurent OriginalPaper Pages: 97 - 108
Facets and lifting procedures for the set covering polytope Paolo NobiliAntonio Sassano OriginalPaper Pages: 111 - 137
The boolean quadric polytope: Some characteristics, facets and relatives Manfred Padberg OriginalPaper Pages: 139 - 172
Strong formulations for mixed integer programming: A survey Laurence Wolsey OriginalPaper Pages: 173 - 191
Algorithms for proportional matrices in reals and integers M. L. BalinskiG. Demange OriginalPaper Pages: 193 - 210
Multi-constrained matroidal knapsack problems P. M. CameriniF. MaffioliC. Vercellis OriginalPaper Pages: 211 - 231
New lower bounds for the Symmetric Travelling Salesman Problem G. CarpanetoM. FischettiP. Toth OriginalPaper Pages: 233 - 254
On the geometric structure of independence systems Michele ConfortiMonique Laurent OriginalPaper Pages: 255 - 277
Odd cycles and matrices with integrality properties Michele ConfortiM. R. Rao OriginalPaper Pages: 279 - 294
Four problems on graphs with excluded minors Huiling GanEllis L. Johnson OriginalPaper Pages: 311 - 330
Facets and algorithms for capacitated lot sizing Janny M. Y. LeungThomas L. MagnantiRita Vachani OriginalPaper Pages: 331 - 359
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications M. Minoux OriginalPaper Pages: 361 - 372
A direct active set algorithm for large sparse quadratic programs with simple bounds Thomas F. ColemanLaurie A. Hulbert OriginalPaper Pages: 373 - 406
Some numerical experiments with variable-storage quasi-Newton algorithms Jean Charles GilbertClaude Lemaréchal OriginalPaper Pages: 407 - 435
A practical anti-cycling procedure for linearly constrained optimization Philip E. GillWalter MurrayMargaret H. Wright OriginalPaper Pages: 437 - 474
New crash procedures for large systems of linear constraints Nicholas I. M. GouldJohn K. Reid OriginalPaper Pages: 475 - 501
On the limited memory BFGS method for large scale optimization Dong C. LiuJorge Nocedal OriginalPaper Pages: 503 - 528
Block truncated-Newton methods for parallel optimization Stephen G. NashAriela Sofer OriginalPaper Pages: 529 - 546
A tolerant algorithm for linearly constrained optimization calculations M. J. D. Powell OriginalPaper Pages: 547 - 566