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.44zbMATH Open0753.90050OpenAlexW2109052795MaRDI QIDQ4018152FDOQ4018152
Authors: Jaya Singhal, Roy E. Marsten, Thomas 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
Recommendations
- The reduced cost branch and bound algorithm for mixed integer programming
- An implicit branch-and-bound algorithm for mixed-integer linear programming
- An intelligent algorithm for mixed-integer programming models
- Technical Note—An Improved Branch-and-Bound Method for Integer Programming
- MINTO, a Mixed INTeger Optimizer
Computational methods for problems pertaining to operations research and mathematical programming (90-08) Mixed integer programming (90C11)
Cited In (11)
- A constrained nonlinear 0-1 program for data allocation
- Multicriteria hub decision making for rural area telecommunication networks
- Technical Note—A Langrangian Algorithm for the Multiple Choice Integer Program
- A bootstrap heuristic for designing minimum cost survivable networks
- Symbolic integration of logic in MILP branch and bound methods for the synthesis of process 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
- An intelligent algorithm for mixed-integer programming models
- Supporting rural telecommunications: A compromise solutions approach
- The reduced cost branch and bound algorithm for mixed integer programming
This page was built for publication: Fixed Order Branch-and-Bound Methods for Mixed-Integer Programming: The <scp>zoom</scp> System
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4018152)
