Continuous maximal covering location problems with interconnected facilities

DOI10.1016/j.cor.2021.105310OpenAlexW3149435761MaRDI QIDQ2668753

Ricardo Gázquez, Víctor Blanco

Publication date: 7 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2005.03274

zbMATH Keywords

continuous locationinteger linear programmingmixed integer nonlinear programmingmaximal covering locationbranch-\&-cut approaches

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Continuous location (90B85) Nonconvex programming, global optimization (90C26)

Related Items (6)

Advanced network connectivity features and zonal requirements in covering location problems ⋮ Fairness in maximal covering location problems ⋮ The concept of modeling packing and covering problems using modern computational geometry software ⋮ Multi-type maximal covering location problems: hybridizing discrete and continuous problems ⋮ Efficient presolving methods for solving maximal covering and partial set covering location problems ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem

Cites Work

• Unnamed Item
• Unnamed Item
• Continuous multifacility ordered median location problems
• Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
• A decomposition heuristic for the maximal covering location problem
• Demand point aggregation for planar covering location models
• Aggregation effects in maximum covering models
• Heuristic methods for large centroid clustering problems
• Exact and heuristic approaches for the cycle hub location problem
• Median and covering location problems with interconnected facilities
• Speeding up the optimal method of Drezner for the \(p\)-centre problem in the plane
• Location covering models. History, applications and advancements
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• Minimizing movement
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search
• Integer Programming Formulation of Traveling Salesman Problems
• The p-Centre Problem-Heuristic and Optimal Algorithms
• Very Simple Methods for All Pairs Network Flow Analysis
• The Maximum Coverage Location Problem
• Using Block Norms for Location Modeling
• Recent Applications of the Maximal Covering Location Planning (M.C.L.P.) Model
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• The Ring Star Problem: Polyhedral analysis and exact algorithm
• A robust sensor covering and communication problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Continuous maximal covering location problems with interconnected facilities