A Criterion of Polynomial-Time Solvability for the Network Location Problem

Alexander A. Ageev. A Criterion of Polynomial-Time Solvability for the Network Location Problem. In Egon Balas, Gérard Cornuéjols, Ravi Kannan, editors, Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992. pages 237-245, Carnegie Mellon University, 1992.

@inproceedings{Ageev92,
  title = {A Criterion of Polynomial-Time Solvability for the Network Location Problem},
  author = {Alexander A. Ageev},
  year = {1992},
  researchr = {https://researchr.org/publication/Ageev92},
  cites = {0},
  citedby = {0},
  pages = {237-245},
  booktitle = {Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, May 1992},
  editor = {Egon Balas and Gérard Cornuéjols and Ravi Kannan},
  publisher = {Carnegie Mellon University},
}