In this paper we give an O(pn2) algorithm for solving the p-facility location problem on the line when the cost of serving any customer is a unimodal ...
In this paper we give an O( pn²) algorithm for solving the p-facility location problem on the line when the cost of serving.
In this paper we give an O(pn2) algorithm for solving the p-facility location problem on the line when the cost of serving any customer is a unimodal ...
Structured p-facility location problems on the line solvable in polynomial time · V. Hsu, T. Lowe, A. Tamir · Published in Operations Research Letters 1 November ...
In this paper, we propose a polynomial-time algorithm for the discrete version of the problem with capacity constraints regarding the number of served clients.
In this paper we give an O(pn^2) algorithm for solving the p-facility location problem on the line when the cost of serving any customer is a unimodal ...
In this paper we give an O(pn2) algorithm for solving the p-facility location problem on the line when the cost of serving any customer is a unimodal ...
Bibliographic details on Structured p-facility location problems on the line solvable in polynomial time.
People also ask
Which of the problems are solvable in polynomial time?
Are NP-hard problems solvable in polynomial time?
Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir: Structured p-facility location problems on the line solvable in polynomial time. 159-164 ; Bo Chen, Arjen P. A. ...
This paper examines capacitated facility location problems on a straight line. To serve a customer, a facility must be located within a corresponding ...