default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMathematical Programming, Volume 45
Volume 45, Numbers 1-3, August 1989
- Egon Balas, Shu Ming Ng:
On the set covering polytope: II. Lifting the facets with coefficients in {0, 1, 2}. 1-20 - Francisco Barahona, Ali Ridha Mahjoub:
Facets of the balanced (acyclic) induced subgraph polytope. 21-33 - Sunil Chopra
:
On ternary problems. 35-47 - A. B. Gamble, William R. Pulleyblank:
Forest covers and a polyhedral intersection theorem. 49-58 - Martin Grötschel, Yoshiko Wakabayashi:
A cutting plane algorithm for a clustering problem. 59-96 - Monique Laurent:
A generalization of antiwebs to independence systems and their canonical facets. 97-108 - Denis Naddef:
The hirsch conjecture is true for (0, 1)-polytopes. 109-110 - Paolo Nobili, Antonio Sassano:
Facets and lifting procedures for the set covering polytope. 111-137 - Manfred Padberg:
The boolean quadric polytope: Some characteristics, facets and relatives. 139-172 - Laurence A. Wolsey:
Strong formulations for mixed integer programming: A survey. 173-191 - Michel L. Balinski, Gabrielle Demange:
Algorithms for proportional matrices in reals and integers. 193-210 - Paolo M. Camerini, Francesco Maffioli, Carlo Vercellis:
Multi-constrained matroidal knapsack problems. 211-231 - Giorgio Carpaneto, Matteo Fischetti, Paolo Toth:
New lower bounds for the Symmetric Travelling Salesman Problem. 233-254 - Michele Conforti, Monique Laurent:
On the geometric structure of independence systems. 255-277 - Michele Conforti, M. R. Rao:
Odd cycles and matrices with integrality properties. 279-294 - Giorgio Gallo, Bruno Simeone:
On the supermodular knapsack problem. 295-309 - Huiling Gan, Ellis L. Johnson:
Four problems on graphs with excluded minors. 311-330 - Janny M. Y. Leung, Thomas L. Magnanti, Rita Vachani:
Facets and algorithms for capacitated lot sizing. 331-359 - Michel Minoux:
Solving combinatorial problems with combined Min-Max-Min-Sum objective and applications. 361-372 - Thomas F. Coleman, Laurie A. Hulbert:
A direct active set algorithm for large sparse quadratic programs with simple bounds. 373-406 - Jean Charles Gilbert, Claude Lemaréchal:
Some numerical experiments with variable-storage quasi-Newton algorithms. 407-435 - Philip E. Gill, Walter Murray, Michael A. Saunders, Margaret H. Wright:
A practical anti-cycling procedure for linearly constrained optimization. 437-474 - Nicholas I. M. Gould, John K. Reid:
New crash procedures for large systems of linear constraints. 475-501 - Dong C. Liu, Jorge Nocedal:
On the limited memory BFGS method for large scale optimization. 503-528 - Stephen G. Nash, Ariela Sofer:
Block truncated-Newton methods for parallel optimization. 529-546 - M. J. D. Powell:
A tolerant algorithm for linearly constrained optimization calculations. 547-566
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
