A branch-and-bound algorithm for the location of facilities causing atmospheric pollution

DOI10.1016/0377-2217(92)90067-JzbMath0760.90066OpenAlexW1972806284MaRDI QIDQ1197644

John Karkazis, Costas Papadimitriou

Publication date: 16 January 1993

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

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90067-j

zbMATH Keywords

branch-and-boundlocation of obnoxious facilities

Mathematics Subject Classification ID

Continuous location (90B85) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)

Related Items

Asymmetric distance location model ⋮ The location of ambivalent facilities: Use of a quadratic zero-one programming algorithm ⋮ Hazardous waste management problem: the case for incineration ⋮ A continuous location model for siting a non-noxious undesirable facility within a geographical region ⋮ The problem of locating facilities causing airborne pollution revisited ⋮ GBSSS: The generalized big square small square method for planar single- facility location ⋮ Probabilistic subproblem selection in branch-and-bound algorithms ⋮ Undesirable facility location with minimal covering objectives ⋮ Spatial organization of an industrial area: Distribution of the environmental cost and equity policies ⋮ The obnoxious \(p\) facility network location problem with facility interaction ⋮ The Location of Undesirable Facilities

Cites Work

• The Minisum and Minimax Location Problems Revisited
• A Maxmin Location Problem
• Unnamed Item

This page was built for publication: A branch-and-bound algorithm for the location of facilities causing atmospheric pollution