A column generation approach for the maximal covering location problem

DOI10.1111/j.1475-3995.2007.00593.xzbMath1145.90418OpenAlexW1969248685MaRDI QIDQ5449883

Edson Luiz França Senne, Marcos Antonio 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

column generationfacility locationLagrangean/surrogate relaxation

Mathematics Subject Classification ID

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

Related Items (4)

A hybrid method for the probabilistic maximal covering location-allocation problem ⋮ A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation ⋮ A mixed integer linear program and tabu search approach for the complementary edge covering problem ⋮ Emergency service systems: The use of the hypercube queueing model in the solution of probabilistic location problems

Uses Software

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving binary cutting stock problems by column generation and branch- and-bound
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• A Parametric Decomposition Approach for the Solution of Uncapacitated Location Problems
• Column Generation
• A Primer in Column Generation
• Cluster Analysis and Mathematical Programming

This page was built for publication: A column generation approach for the maximal covering location problem