Primal-Dual Variable Neighborhood Search for the Simple Plant-Location Problem
From MaRDI portal
Publication:2892367
DOI10.1287/ijoc.1060.0196zbMath1241.90072OpenAlexW2003457692WikidataQ57254151 ScholiaQ57254151MaRDI QIDQ2892367
Dragan Urošević, Pierre Hansen, Nenad Mladenović, Jack Brimberg
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: http://bura.brunel.ac.uk/handle/2438/6678
metaheuristicsbranch and boundprimal-dual methodssimple plant-location problemvariable-neighborhood search
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Variable neighbourhood structures for cycle location problems, Matheuristics: survey and synthesis, Location Science in Canada, Variable neighborhood search: the power of change and simplicity, The balanced \(p\)-median problem with unitary demand, On a class of subadditive duals for the uncapacitated facility location problem, A general VNS heuristic for the traveling salesman problem with time windows, Variable neighborhood search: basics and variants, A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem, Exact \(L_{2}\)-norm plane separation, An exact cooperative method for the uncapacitated facility location problem, New local searches for solving the multi-source Weber problem, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, Fast bounding procedures for large instances of the simple plant location problem, An aggregation heuristic for large scale p-median problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Variable neighbourhood search: methods and applications, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem, Variable neighbourhood search: Methods and applications, Exact Solution of Two Location Problems via Branch-and-Bound
