An Automatic Method for Solving Discrete Programming Problems
From MaRDI portal
Publication:3565234
DOI10.1007/978-3-540-68279-0_5zbMath1187.90016OpenAlexW2091364465MaRDI QIDQ3565234
Publication date: 3 June 2010
Published in: 50 Years of Integer Programming 1958-2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68279-0_5
Collected or selected works; reprintings or translations of classics (01A75) History of operations research and mathematical programming (90-03)
Related Items (12)
\(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization ⋮ Solving differential equations with artificial bee colony programming ⋮ Unnamed Item ⋮ Learning pseudo-backdoors for mixed integer programs ⋮ Enumeration of irredundant forests ⋮ A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables ⋮ Local branching relaxation heuristics for integer linear programs ⋮ Query-Augmented Active Metric Learning ⋮ An optimal-transport finite-particle method for mass diffusion ⋮ Efficient data structures for model-free data-driven computational mechanics ⋮ Bayesian optimization of variable-size design space problems ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
This page was built for publication: An Automatic Method for Solving Discrete Programming Problems
