Algebraic modeling for IP and MIP (GAMS)
From MaRDI portal
Publication:537584
DOI10.1007/s10479-006-0104-xzbMath1213.90013OpenAlexW1966921567MaRDI QIDQ537584
Alexander Meeraus, Michael R. Bussieck
Publication date: 20 May 2011
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-006-0104-x
Integer programming (90C10) Mixed integer programming (90C11) History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03)
Related Items (2)
Uses Software
Cites Work
- MINTO, a Mixed INTeger Optimizer
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An Oil Pipeline Design Problem
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
This page was built for publication: Algebraic modeling for IP and MIP (GAMS)