EUVIMEDEUVIMED entdecken
Crossref

Preprocessing and Probing Techniques for Mixed Integer Programming Problems

M. W. P. Savelsbergh

ORSA Journal on Computing · 1994-11 · 6 (4) · 445-454

DOI: 10.1287/ijoc.6.4.445 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ORSA Journal on Computing, 1994-11. Verfasst von M. W. P. Savelsbergh. Die Arbeit wurde bisher 293-mal zitiert (Crossref).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

In the first part of the paper, we present a framework for describing basic techniques to improve the representation of a mixed integer programming problem. We elaborate on identification of infeasibility and redundancy, improvement of bounds and coefficients, and fixing of binary variables. In the second part of the paper, we discuss recent extensions to these basic techniques and elaborate on the investigation and possible uses of logical consequences. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.

Zitieren

APA

Savelsbergh, M. W. P. (1994). Preprocessing and Probing Techniques for Mixed Integer Programming Problems. ORSA Journal on Computing, 6(4), 445-454. https://doi.org/10.1287/ijoc.6.4.445

Vancouver

Savelsbergh MWP. Preprocessing and Probing Techniques for Mixed Integer Programming Problems. ORSA Journal on Computing. 1994;6(4):445-454. doi:10.1287/ijoc.6.4.445

BibTeX
@article{Savelsbergh1994,
  author = {Savelsbergh, M. W. P.},
  title = {Preprocessing and Probing Techniques for Mixed Integer Programming Problems},
  journal = {ORSA Journal on Computing},
  year = {1994},
  volume = {6},
  number = {4},
  pages = {445--454},
  doi = {10.1287/ijoc.6.4.445}
}
Kostenlos starten →