Login / Signup

A heuristic for the p-center problems in graphs.

Ján Plesník
Published in: Discret. Appl. Math. (1987)
Keyphrases
  • optimization problems
  • dynamic programming
  • linear programming
  • np complete
  • directed graph
  • graph matching
  • mathematical programming
  • graph representation
  • heuristic methods
  • finding an optimal solution