An automatic method for solving discrete programming problems
From MaRDI portal
Recommendations
Cited in
(16)- An optimal-transport finite-particle method for mass diffusion
- A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem
- ``Outline of an algorithm for integer solutions to linear programs and ``An algorithm for the mixed integer problem
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Branch and bound for piecewise linear neural network verification
- Bayesian optimization of variable-size design space problems
- \(\mathcal{H}\)-polytope decomposition-based algorithm for continuous optimization
- Strong bounds for resource constrained project scheduling: preprocessing and cutting planes
- Solving differential equations with artificial bee colony programming
- Query-Augmented Active Metric Learning
- Learning pseudo-backdoors for mixed integer programs
- Enumeration of irredundant forests
- Local branching relaxation heuristics for integer linear programs
- On the multiple optimal solutions and patterns of the pallet loading problem
- Local-MIP: efficient local search for mixed integer programming
- Efficient data structures for model-free data-driven computational mechanics
This page was built for publication: An automatic method for solving discrete programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3565234)
