A Lagrangian-Based Branch-and-Bound Algorithm for the Two-Level Uncapacitated Facility Location Problem with Single-Assignment Constraints
Transportation science ; 50 , 4 ; 1286-1299
2016-01-01
14 pages
Aufsatz (Zeitschrift)
Englisch
DDC: | 388.011 |
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
The Dynamic Uncapacitated Hub Location Problem
British Library Online Contents | 2011
|The Dynamic Uncapacitated Hub Location Problem
Online Contents | 2011
|Uncapacitated Facility Location with Allocation of Matched and Unmatched Clients
British Library Conference Proceedings | 1997
|