A column generation approach for the maximal covering location problem

DOI10.1111/J.1475-3995.2007.00593.XMaRDI QIDQ5449883zbMATHOpenAlexFDO

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

zbMATH Keywords

facility locationcolumn generationLagrangean/surrogate relaxation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Discrete location and assignment (90B80)

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

• scientific article; zbMATH DE number 193499 (Why is no real title available?)
• scientific article; zbMATH DE number 821272 (Why is no real title available?)
• scientific article; zbMATH DE number 3324320 (Why is no real title available?)
• A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
• A Primer in Column Generation
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Cluster Analysis and Mathematical Programming
• Column Generation
• Solving binary cutting stock problems by column generation and branch- and-bound

Cited in

(10)

• A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
• A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation
• The minimum likely column cover 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
• A column generation approach to capacitated \(p\)-median problems
• 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
• Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems
• A hybrid method for the probabilistic maximal covering location-allocation problem

Describes a project that uses

Uses Software

• CPLEX
• SITATION
• MOD-DIST
• MENU-OKF

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)