Bounds for the single source modular capacitated plant location problem
From MaRDI portal
Publication:2489136
DOI10.1016/J.COR.2005.02.030zbMATH Open1086.90035OpenAlexW1978115795MaRDI QIDQ2489136FDOQ2489136
Isabel H. Correia, Maria Eugénia Captivo
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.030
Recommendations
- Upper and lower bounds for the single source capacitated location problem.
- Efficient solution of large scale, single-source, capacitated plant location problems
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Valid inequalities and facets of the capacitated plant location problem
- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- The capacity and distance constrained plant location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)
Cites Work
- Title not available (Why is that?)
- An algorithm for solving large capacitated warehouse location problems
- An efficient tabu search procedure for the \(p\)-median problem
- Lagrangean heuristics for location problems
- Title not available (Why is that?)
- Validation of subgradient optimization
- A two-phase tabu search approach to the location routing problem
- Upper and lower bounds for the single source capacitated location problem.
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- A Lagrangean heuristic for a modular capacitated location problem
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
Cited In (9)
- Stochastic facility location with general long-run costs and convex short-run costs
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Upper and lower bounds for the single source capacitated location problem.
- Solution method for the location planning problem of logistics park with variable capacity
- The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
- Location of slaughterhouses under economies of scale
- A Lagrangean heuristic for a modular capacitated location problem
Uses Software
This page was built for publication: Bounds for the single source modular capacitated plant location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489136)
