Lagrangean heuristics applied to a variety of large capacitated plant location problems
From MaRDI portal
Publication:3157781
DOI10.1057/palgrave.jors.2600621zbMath1140.90419OpenAlexW2065090002MaRDI QIDQ3157781
No author found.
Publication date: 19 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600621
Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (10)
A maximal covering location model in the presence of partial coverage ⋮ A perturbation-based heuristic for the capacitated multisource Weber problem ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Upper and lower bounds for the single source capacitated location problem. ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ Defining tabu list size and aspiration criterion within tabu search methods ⋮ Region-rejection based heuristics for the capacitated multi-source Weber problem
This page was built for publication: Lagrangean heuristics applied to a variety of large capacitated plant location problems
