Some properties of cliques in 0–1 mixed integer programs
Author
Abstract
Suggested Citation
DOI: 10.1007/BF02568509
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Monique Guignard & Kurt Spielberg, 1981. "Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables," Operations Research, INFORMS, vol. 29(1), pages 49-74, February.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Escudero Bueno, Laureano F. & Garín Martín, María Araceli & Merino Maestre, María & Pérez Sainz de Rozas, Gloria, 2011. "A parallelizable algorithmic framework for solving large scale multi-stage stochastic mixed 0-1 problems under uncertainty," BILTOKI 1134-8984, Universidad del País Vasco - Departamento de Economía Aplicada III (Econometría y Estadística).
- Ambros Gleixner & Leona Gottwald & Alexander Hoen, 2023. "P a PILO: A Parallel Presolving Library for Integer and Linear Optimization with Multiprecision Support," INFORMS Journal on Computing, INFORMS, vol. 35(6), pages 1329-1341, November.
- Patrick Gemander & Wei-Kun Chen & Dieter Weninger & Leona Gottwald & Ambros Gleixner & Alexander Martin, 2020. "Two-row and two-column mixed-integer presolve using hashing-based pairing methods," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 8(3), pages 205-240, October.
- Ellis L. Johnson & George L. Nemhauser & Martin W.P. Savelsbergh, 2000. "Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition," INFORMS Journal on Computing, INFORMS, vol. 12(1), pages 2-23, February.
- Robert Ashford, 2007. "Mixed integer programming: A historical perspective with Xpress-MP," Annals of Operations Research, Springer, vol. 149(1), pages 5-17, February.
- Tobias Achterberg & Robert E. Bixby & Zonghao Gu & Edward Rothberg & Dieter Weninger, 2020. "Presolve Reductions in Mixed Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 473-506, April.
More about this item
Keywords
Preprocessing; Cliques; Knapsack Constraints; Redundancy;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:topjnl:v:4:y:1996:i:2:p:215-223. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.