Minimum cost b-matching problems with neighborhoods.

Inmaculada Espejo Rafael Paz Justo Puerto Antonio M. Rodríguez-Chía

Published in: Comput. Optim. Appl. (2022)

Keyphrases

minimum cost
network flow problem
minimum cost flow
np complete
np hard
spanning tree
approximate matching
linear relaxation
network simplex algorithm
pattern matching
edit operations
polynomially solvable
minimum cost path