An implicit branch-and-bound algorithm for mixed-integer linear programming

From MaRDI portal
Revision as of 11:06, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision β†’ (diff)

Publication:804472

DOI10.1016/0305-0548(90)90050-HzbMATH Open0727.90058OpenAlexW2008600006MaRDI QIDQ804472FDOQ804472

Youling Lin, James R. Burns, Larry M. Austin

Publication date: 1990

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(90)90050-h





Cites Work


Cited In (9)


Recommendations





This page was built for publication: An implicit branch-and-bound algorithm for mixed-integer linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804472)