Login / Signup
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs.
Luciano Porretta
Daniele Catanzaro
Bjarni V. Halldórsson
Bernard Fortz
Published in:
4OR (2019)
Keyphrases
</>
minimum cost
np hard
spanning tree
undirected graph
computational complexity
matching algorithm
network flow
objective function
search space
approximation algorithms
edit operations
optimal solution
scheduling problem
combinatorial optimization
graph structure
optimization model