A column generation approach for the maximal covering location problem
From MaRDI portal
Publication:5449883
DOI10.1111/J.1475-3995.2007.00593.XzbMATH Open1145.90418OpenAlexW1969248685MaRDI QIDQ5449883FDOQ5449883
Authors: E. L. F. Senne, Marcos A. Pereira, Luiz Antonio Nogueira Lorena
Publication date: 19 March 2008
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00593.x
Recommendations
- A branch-and-price approach to \(p\)-median location problems
- A column generation approach to capacitated \(p\)-median problems
- A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
- Generalized column generation for linear programming
- Stabilized column generation
Cites Work
- An Algorithm for Least-Squares Estimation of Nonlinear Parameters
- Title not available (Why is that?)
- A Primer in Column Generation
- Column Generation
- Cluster Analysis and Mathematical Programming
- Solving binary cutting stock problems by column generation and branch- and-bound
- Title not available (Why is that?)
- A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
- Title not available (Why is that?)
Cited In (10)
- Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems
- Accelerated Benders decomposition and local branching for dynamic maximum covering location problems
- A column generation approach to capacitated \(p\)-median problems
- A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
- A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
- The minimum likely column cover problem
- A hybrid method for the probabilistic maximal covering location-allocation problem
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- A mixed integer linear program and tabu search approach for the complementary edge covering problem
Uses Software
This page was built for publication: A column generation approach for the maximal covering location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5449883)