A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games.
Maria Patricia DobsonValeria A. LeoniGraciela L. NasiniPublished in: Discret. Optim. (2013)
Keyphrases
- combinatorial optimization
- combinatorial optimization problems
- graph theory
- traveling salesman problem
- simulated annealing
- metaheuristic
- branch and bound
- optimization problems
- combinatorial problems
- branch and bound algorithm
- mathematical programming
- weighted graph
- worst case
- edge detection
- single machine scheduling problem
- game playing
- undirected graph
- max flow min cut
- computational complexity
- vehicle routing problem
- decision problems
- approximation algorithms
- graph mining
- computer games
- tabu search
- exact algorithms
- graph cuts
- dynamic programming