Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
From MaRDI portal
Publication:4018152
DOI10.1287/ijoc.1.1.44zbMath0753.90050OpenAlexW2109052795MaRDI QIDQ4018152
Jaya Singhal, Roy E. Marsten, Thomas L. Morin
Publication date: 16 January 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1.1.44
Mixed integer programming (90C11) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (8)
Supporting rural telecommunications: A compromise solutions approach ⋮ Symbolic integration of logic in MILP branch and bound methods for the synthesis of process networks ⋮ A bootstrap heuristic for designing minimum cost survivable networks ⋮ An algorithm for the mixed-integer nonlinear bilevel programming problem ⋮ A multiple criteria model for the allocation of data files in a distributed information system ⋮ Weighted graphs and university course timetabling ⋮ Multicriteria hub decision making for rural area telecommunication networks ⋮ A constrained nonlinear 0-1 program for data allocation
This page was built for publication: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
