Divide and Conquer for Combinatorial Optimization and Distributed Quantum Computation.
Teague TomeshZain H. SaleemMichael A. PerlinPranav GokhaleMartin SucharaMargaret MartonosiPublished in: QCE (2023)
Keyphrases
- combinatorial optimization
- quantum computation
- traveling salesman problem
- combinatorial optimization problems
- combinatorial problems
- simulated annealing
- optimization problems
- branch and bound
- distributed systems
- branch and bound algorithm
- metaheuristic
- quadratic assignment problem
- mathematical programming
- peer to peer
- max flow min cut
- multi agent
- vehicle routing problem
- exact algorithms
- cooperative
- graph theory
- greedy algorithm
- single machine scheduling problem
- distributed environment
- hard combinatorial optimization problems
- mobile agents
- memetic algorithm