A first course in linear optimization

DOI10.1137/1.9781611978308MaRDI QIDQ6992376zbMATH OpenFDO

Authors Amir Beck, Nili Guttmann-Beck

Publication date 28 April 2025

Published in Computational Science \& Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611978308

zbMATH Keywords

branch-and-bounddualitydynamic programminggame theoryGomory cutsinteger programminglinear optimizationlinear programmingnetworks and flow problemssimplex methodtotal unimodularity

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Linear programming (90C05) Integer programming (90C10) Convex programming (90C25) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59)

This page was built for publication: A first course in linear optimization

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