Approximability of combinatorial problems with multi-agent submodular cost functions.
Gagan GoelChinmay KarandePushkar TripathiLei WangPublished in: SIGecom Exch. (2010)
Keyphrases
- combinatorial problems
- cost function
- multi agent
- constraint programming
- objective function
- metaheuristic
- combinatorial optimization
- traveling salesman problem
- constraint satisfaction problems
- graph coloring
- phase transition
- constraint satisfaction
- solving hard
- greedy algorithm
- optimization problems
- branch and bound algorithm
- search space reduction
- combinatorial search
- global constraints
- multi agent systems
- reinforcement learning
- approximation algorithms
- specific problems
- hard combinatorial optimization problems
- lower bound
- ant colony optimization
- energy minimization
- linear programming
- constraint propagation
- graph colouring