Results 21 to 30 of about 49 (49)
Efficient solution methods for covering tree problems
location, covering, tree covering, 90B80, 90C27, 90C35,
T. Boffey
core +1 more source
A Fast Algorithm for Weber Problem on a Grid [PDF]
, 1998 AMS subject classification: 90B80.The Weber problem is to find a supply point in a plane such that total weighted distance between supply point and a set of demand points is minimized. No known algorithm finds the exact solution.
Lee, H.
core
Thep-facility ordered median problem on networks
Location, networks, finite dominating sets, 90B10, 90B80, 90B85,
J. Puerto +3 more
core +1 more source
Multi-period location-assignment, Pure 0–1 formulations, Impulse variables, Step variables, 90B80, 90C10, 90B06,
Celeste Pizarro-Romero +5 more
core +1 more source
An approach for solving a modification of the extended rapid transit network design problem
Station and link location, Circular line, Line designing, Degree of a node, 90B06, 90B80, 90C10, 90C35,
L. Escudero, S. Muñoz
core +1 more source
Optimality of the Round Robin Routing Policy
, 1994 In this paper we consider the problem of routing customers to identical servers, each with its own infinite capacity queue. Under the assumptions that i) the service times form a sequence of independent and identically distributed random variables with ...
Don Towsley +3 more
core
Lower Bounds For The Quadratic Assignment Problem
, 1994 . We investigate the classical Gilmore-Lawler lower bound for the quadratic assignment problem. We provide evidence of the difficulty of improving the Gilmore-Lawler Bound and develop new bounds by means of optimal reduction schemes.
Y. Li +3 more
core
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Optimal Algorithms for Some Inverse Uncapacitated Facility Location Problems on Networks
Optimization Methods and Software, 2022Behrooz Alizadeh, Fahimeh Baroughi
exaly