A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
From MaRDI portal
Publication:2253409
DOI10.1016/j.ejor.2012.07.042zbMath1292.90172OpenAlexW1973050546MaRDI QIDQ2253409
Marcos Costa Roboredo, Artur Alves Pessoa
Publication date: 27 July 2014
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.07.042
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Hierarchical games (including Stackelberg games) (91A65) Discrete location and assignment (90B80)
Related Items (21)
Models and algorithms for competitive facility location problems with different customer behavior ⋮ Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems ⋮ Exact method for the capacitated competitive facility location problem ⋮ Planning a defense that minimizes a resource deficit in the worst-case scenario of supply network destruction ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ An exact method for the discrete \((r|p)\)-centroid problem ⋮ Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players ⋮ Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem ⋮ The generalized discrete ‐centroid problem ⋮ A kernel search matheuristic to solve the discrete leader-follower location problem ⋮ On the complexity of the \((r|p)\)-centroid problem in the plane ⋮ Fast metaheuristics for the discrete \((r|p)\)-centroid problem ⋮ An exact approach for the \(r\)-interdiction covering problem with fortification ⋮ Radio communications interdiction problem under deterministic and probabilistic jamming ⋮ On competition in a Stackelberg location-design model with deterministic supplier choice ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ An exact approach for the r-interdiction median problem with fortification ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches
This page was built for publication: A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem
