Migration of Monoliths through the Synthesis of Microservices using Combinatorial Optimization.
Gianluca FilipponeMarco AutiliFabrizio RossiMassimo TivoliPublished in: ISSRE Workshops (2021)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- traveling salesman problem
- metaheuristic
- branch and bound
- simulated annealing
- optimization problems
- branch and bound algorithm
- combinatorial problems
- vehicle routing problem
- graph theory
- combinatorial search
- mathematical programming
- hard combinatorial optimization problems
- exact algorithms
- memetic algorithm
- job shop scheduling problem
- single machine scheduling problem
- quadratic assignment problem
- dynamic programming
- image segmentation