Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking
From MaRDI portal
Publication:2043801
DOI10.1016/j.jlamp.2021.100664OpenAlexW3126515914MaRDI QIDQ2043801
Mădălina Eraşcu, Flavia Micota, Daniela Zaharie
Publication date: 3 August 2021
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.05401
mathematical programmingsymmetry breakingcloud computingoptimization modulo theoryresource provisioning
Uses Software
Cites Work
- Unnamed Item
- Efficient symmetry breaking formulations for the job grouping problem
- Interval propagation to reason about sets: Definition and implementation of a practical language
- Bin packing can be solved within 1+epsilon in linear time
- LP models for bin packing and cutting stock problems
- KeY-ABS: A Deductive Verification Tool for the Concurrent Modelling Language ABS
- An Application of Bin-Packing to Multiprocessor Scheduling
- Symbolic optimization with SMT solvers
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking