A method for solving to optimality uncapacitated location problems
From MaRDI portal
Publication:920004
DOI10.1007/BF02097805zbMath0707.90060OpenAlexW2032958993MaRDI QIDQ920004
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
branch-and-boundhierarchical structureprimal-dual algorithmsubgradient optimization3-stage methodp- medianuncapacitated location
Large-scale problems in mathematical programming (90C06) Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A heuristic for large-size \(p\)-median location problems with application to school location, A hybrid multistart heuristic for the uncapacitated facility location problem, Matheuristics: survey and synthesis, On a class of subadditive duals for the uncapacitated facility location problem, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, The Location of Public Schools: Evaluation of Practical Experiences, An exact cooperative method for the uncapacitated facility location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Capacitated facility location problem with general setup cost, Location analysis: a synthesis and survey, Affinity propagation and uncapacitated facility location problems, An aggressive reduction scheme for the simple plant location problem, Lagrangean heuristics for location problems, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, Solving to optimality the uncapacitated fixed-charge network flow problem, Massively parallel analog tabu search using neural networks applied to simple plant location problems, An exact method for the two-echelon, single-source, capacitated facility location problem, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Algorithms for a multi-level network optimization problem, A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro, An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
Cites Work
- Unnamed Item
- Unnamed Item
- A comparison of two dual-based procedures for solving the p-median problem
- A tree search algorithm for the multi-commodity location problem
- A note on solving large p-median problems
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- A tree search algorithm for the p-median problem
- p-Medians and Multi-Medians
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- A Dual-Based Procedure for Uncapacitated Facility Location
- A Dual-Bounded Algorithm for the p-Median Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- Validation of subgradient optimization
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Gradient methods for solving equations and inequalities
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- A man-machine approach toward solving the traveling salesman problem
- Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
