On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines

Original language	English
Pages (from-to)	S58-S72
Number of pages	15
Journal	Proceedings of the Steklov Institute of Mathematics
Volume	313
Issue number	SUPPL 1
DOIs	https://doi.org/10.1134/S0081543821030081
Publication status	Published - Aug 2021

facility location problem, capacities, multiple allocation, single allocation, NP-hard problem, treewidth, pseudopolynomial-time algorithm, polynomial-time algorithm, UNSPLITTABLE FLOW, ALGORITHMS, TREES, PATHS

ID: 29277054