A method for solving to optimality uncapacitated location problems
From MaRDI portal
DOI10.1007/BF02097805zbMATH Open0707.90060OpenAlexW2032958993MaRDI QIDQ920004FDOQ920004
Luiz Aurélio Raggi, Roberto Diéguez Galvão
Publication date: 1989
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02097805
hierarchical structuresubgradient optimizationprimal-dual algorithmbranch-and-bound3-stage methodp- medianuncapacitated location
Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Discrete location and assignment (90B80)
Cites Work
- A note on solving large p-median problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- Validation of subgradient optimization
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Title not available (Why is that?)
- A comparison of two dual-based procedures for solving the p-median problem
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A Dual-Bounded Algorithm for the p-Median Problem
- Technical Note—An Algorithm for the p-Median Problem
- A tree search algorithm for the p-median problem
- A man-machine approach toward solving the traveling salesman problem
- Gradient methods for solving equations and inequalities
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
- p-Medians and Multi-Medians
- Title not available (Why is that?)
- A tree search algorithm for the multi-commodity location problem
Cited In (31)
- Capacitated facility location problem with general setup cost
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Solving a class of two-dimensional uncapacitated location-allocation problems by dynamic programming
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Algorithms for a multi-level network optimization problem
- Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm
- Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems
- Lagrangean heuristics for location problems
- Matheuristics: survey and synthesis
- Affinity propagation and uncapacitated facility location problems
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Uncapacitated facility location: General solution procedure and computational experience
- Exact solution methods for uncapacitated location problems with convex transportation costs
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
- The Location of Public Schools: Evaluation of Practical Experiences
- A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro
- On a class of subadditive duals for the uncapacitated facility location problem
- Location analysis: a synthesis and survey
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- A heuristic for large-size \(p\)-median location problems with application to school location
- An exact cooperative method for the uncapacitated facility location problem
- RAMP experiments in solving the uncapacitated facility location problem
- Solving to optimality the uncapacitated fixed-charge network flow problem
- A projection method for the uncapacitated facility location problem
- An exact method for the two-echelon, single-source, capacitated facility location problem
- Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
- Title not available (Why is that?)
- An aggressive reduction scheme for the simple plant location problem
- An improved branch \& bound method for the uncapacitated competitive location problem
Recommendations
- Near-optimal solutions to large-scale facility location problems 👍 👎
- Uncapacitated facility location: General solution procedure and computational experience 👍 👎
- Title not available (Why is that?) 👍 👎
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem 👍 👎
- On the exact solution of large-scale simple plant location problems 👍 👎
This page was built for publication: A method for solving to optimality uncapacitated location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q920004)
