Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1241.90072
Hansen, Pierre; Brimberg, Jack; Urošević, Dragan; Mladenović, Nenad
Primal-dual variable neighborhood search for the simple plant-location problem. (English)
[J] INFORMS J. Comput. 19, No. 4, 552-564 (2007). ISSN 1091-9856; ISSN 1526-5528/e

Summary: The variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to $n=15,000$ users, and $m=n$ potential locations for facilities with an error not exceeding $0.04\%$; (ii) exact solution of such instances with up to $m=n=7,000$; and (iii) exact solutions of instances with variable fixed costs and up to $m=n=15,000$.

MSC 2000:: *90B80 Discrete location and assignment
90C59 Approximation methods and heuristics

Keywords: metaheuristics; variable-neighborhood search; primal-dual methods; branch and bound; simple plant-location problem

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]