The generalized discrete ‐centroid problem

DOI10.1111/itor.12289MaRDI QIDQ6066305

Dolores-Rosa Santos-Peñate, José Andrés Moreno-Pérez, Clara M. Campos Rodríguez

Publication date: 15 November 2023

Published in: International Transactions in Operational Research (Search for Journal in Brave)

zbMATH Keywords

linear programmingbilevel problemscompetitive locationleader-follower problem\( ( r | p )\)-centroid\( ( r | X_p )\)-medianoid

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

A kernel search matheuristic to solve the discrete leader-follower location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Metaheuristics for bi-level optimization
• Fast metaheuristics for the discrete \((r|p)\)-centroid problem
• A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem
• An exact procedure and LP formulations for the leader-follower location problem
• Generalized coverage: new developments in covering location models
• The gradual covering decay location problem on a network.
• An alternating heuristic for medianoid and centroid problems in the plane
• A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
• The generalized maximal covering location problem

This page was built for publication: The generalized discrete ‐centroid problem