Integer-friendly formulations for the \(r\)-separation problem
type: Item
instance of: scholarly article
title: Integer-friendly formulations for the \(r\)-separation problem
zbMATH Open document ID: 0912.90223
DOI: 10.1016/0377-2217(94)00348-3
author: C. S. Revelle
author: Erhan Erkut
author: Yilmaz Ülküsal
published in: European Journal of Operational Research
publication date: 1998-10-18T00:00:00Z
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 1212245
zbMATH Keywords: independent set
zbMATH Keywords: \(r\)-separation
zbMATH Keywords: LP-relaxation
describes a project that uses: GAMS
MaRDI profile type: Publication
full work available at URL: 0377-2217(94)00348-3
OpenAlex ID: W2040879163
cites work: Q3351135
cites work: The discrete p-dispersion problem
cites work: Comparison Of Four Models For dispersing Facilities
cites work: Q4198056
cites work: Good solutions to discrete noxious location problems via metaheuristics
cites work: An Analysis of Network Location Problems with Distance Constraints
cites work: Q4037432
cites work: Heuristic and Special Case Algorithms for Dispersion Problems
cites work: Facility siting and integer-friendly programming
cites work: Obnoxious Facility Location on Graphs
cites work: A study on two geometric location problems
cites work: The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic
cites work: Q3991284
Wikidata QID: Q126634794
description: scientific article; zbMATH DE number 1212245