Algebraic modeling for IP and MIP (GAMS)

DOI10.1007/S10479-006-0104-XMaRDI QIDQ537584zbMATH OpenOpenAlexFDO

Authors Michael R. Bussieck, Alexander Meeraus

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

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) History of operations research and mathematical programming (90-03) Integer programming (90C10) Mixed integer programming (90C11)

Cites work

• A branch‐and‐cut algorithm for the single‐commodity, uncapacitated, fixed‐charge network flow problem
• An Oil Pipeline Design Problem
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• MINTO, a Mixed INTeger Optimizer
• The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Cited in

(2)

• Minimal surface convex hulls of spheres
• Mathematical optimization models for fuelwood production

Describes a project that uses

Uses Software

• Performance Libraries
• FCNetLib
• ABACUS
• MINTO
• GAMS
• GAMS Model

This page was built for publication: Algebraic modeling for IP and MIP (GAMS)

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