A Heuristic Ceiling Point Algorithm for General Integer Linear Programming
Year of publication: |
1992
|
---|---|
Authors: | Saltzman, Robert M. ; Hillier, Frederick S. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 38.1992, 2, p. 263-283
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Subject: | integer linear programming | general integer variables | heuristic algorithm | ceiling points | linear programming relaxation | enumeration algorithms |
-
Approaches to a real-world train timetabling problem in a railway node
Cacchiani, Valentina, (2016)
-
Integrated production planning and warehouse storage assignment problem : an IoT assisted case
Zhang, Guoqing, (2021)
-
The multi-resource agent bottleneck generalised assignment problem
Karsu, Özlem, (2012)
- More ...
-
A data-driven approach to scheduling the U.S. presidential primary elections
Saltzman, Robert M., (2022)
-
The multi-day aircraft maintenance routing problem
Saltzman, Robert M., (2022)
-
Three proposals for improving short-term on-street parking
Saltzman, Robert M., (1994)
- More ...