Integer-friendly formulations for the \(r\)-separation problem

DOI10.1016/0377-2217(94)00348-3zbMath0912.90223OpenAlexW2040879163WikidataQ126634794 ScholiaQ126634794MaRDI QIDQ1268268

Charles S. Re Velle, Yilmaz Ülküsal, Erhan Erkut

Publication date: 18 October 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)00348-3

zbMATH Keywords

independent setLP-relaxation\(r\)-separation

Mathematics Subject Classification ID

Integer programming (90C10)

Related Items (5)

The disruptive anti-covering location problem ⋮ Optimal reserve site selection with distance requirements ⋮ Review of obnoxious facilities location problems ⋮ A new compact formulation for the discrete \(p\)-dispersion problem ⋮ A support tool for planning classrooms considering social distancing between students

Uses Software

• GAMS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Good solutions to discrete noxious location problems via metaheuristics
• The discrete p-dispersion problem
• A study on two geometric location problems
• Facility siting and integer-friendly programming
• The maximal dispersion problem and the ``first point outside the neighbourhood heuristic
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• Obnoxious Facility Location on Graphs
• Heuristic and Special Case Algorithms for Dispersion Problems

This page was built for publication: Integer-friendly formulations for the \(r\)-separation problem