DOI

Translated title of the contributionOn some efficiently solvable classes of the network facility location problem with constraints on the capacities of communication lines
Original languageRussian
Pages (from-to)108-124
Number of pages17
JournalTrudy Instituta Matematiki i Mekhaniki UrO RAN
Volume26
Issue number2
DOIs
Publication statusPublished - 25 May 2020

    Research areas

  • Capacities, Facility location problem, Multiple-allocation, NP-hard problem, Polynomial-time algorithm, Pseudopolynomial algorithm, Single-allocation, Treewidth, tree-width, UNSPLITTABLE FLOW, pseudopolynomial algorithm, PATHS, ALGORITHMS, facility location problem, multiple-allocation, TREES, capacities, single-allocation, polynomial-time algorithm

    OECD FOS+WOS

    State classification of scientific and technological information

  • 27 MATHEMATICS

ID: 25310375