New models for close enough facility location problems

DOI10.1016/J.COR.2024.106957MaRDI QIDQ6974947zbMATH OpenFDO

Authors Alejandro Moya-Martínez, Mercedes Landete, Juan F. Monge, Sergio García

Publication date 5 June 2025

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

Full work available at URL https://doi.org/10.1016/J.COR.2024.106957

zbMATH Keywords

close enoughcolumn generationfacility location

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A matheuristic for the distance-constrained close-enough arc routing problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Facility location problems with user cooperation
• scientific article; zbMATH DE number 3827200 (Why is no real title available?)
• On the distance-constrained close enough arc routing problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The close enough traveling salesman problem: a discussion of several heuristics
• The generalized close enough traveling salesman problem
• The min-max close-enough arc routing problem
• The profitable close-enough arc routing problem
• The single-vehicle two-echelon one-commodity pickup and delivery problem

This page was built for publication: New models for close enough facility location problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6974947)