On the existence of an integer solution to the relaxed Weber problem for a tree network

DOI10.1134/S0005117919070063zbMath1430.90549OpenAlexW2961179485MaRDI QIDQ2331474

A. V. Panyukov

Publication date: 29 October 2019

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117919070063

zbMATH Keywords

computational complexitypolynomial algorithmrelaxed probleminteger linear programming problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Cites Work

• Polynomial algorithms to finite Veber problem for a tree network
• Location Theory
• Estimating the Efficiency of Backtrack Programs

This page was built for publication: On the existence of an integer solution to the relaxed Weber problem for a tree network