Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom System
ORSA Journal on Computing · 1989
DOI: 10.1287/ijoc.1.1.44 ↗Kurz gefasst
Fachartikel in der Zeitschrift ORSA Journal on Computing, 1989. Verfasst von Jaya Singhal und 2 weiteren Autor:innen. Die Arbeit wurde bisher 24-mal zitiert (Crossref).
Abstract (Originalsprache)
A branch-and-bound algorithm for mixed-integer programming (MIP) is presented in which a different integer variable is designated for branching at each depth in the search tree. This is done in order to achieve economies of scale in solving the linear programming relaxations to obtain bounds for the (MIP) algorithm. This algorithm is the foundation for the zoom software system, which is briefly described. Illustrative computational experience is included. INFORMS Journal on Computing, ISSN 1091-9856, was published as ORSA Journal on Computing from 1989 to 1995 under ISSN 0899-1499.
Zitieren
APA
Singhal, J., Marsten, R. E., & Morin, T. L. (1989). Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom System. ORSA Journal on Computing. https://doi.org/10.1287/ijoc.1.1.44
Vancouver
Singhal J, Marsten RE, Morin TL. Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom System. ORSA Journal on Computing. 1989. doi:10.1287/ijoc.1.1.44
BibTeX
@article{Singhal1989,
author = {Singhal, Jaya and Marsten, Roy E. and Morin, Thomas L.},
title = {Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The zoom System},
journal = {ORSA Journal on Computing},
year = {1989},
doi = {10.1287/ijoc.1.1.44}
}
EUVIMED