Location of an obnoxious facility on a network: A voting approach

DOI10.1002/NET.3230200206zbMATH Open0689.90026OpenAlexW2025425855MaRDI QIDQ3032043FDOQ3032043

Authors: Martine Labbé 

Publication date: 1990

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230200206

Recommendations

• How bad can a voting locating be
• Distance weighted voting and a single facility location problem
• Algorithms for Voting and Competitive Location on a Network
• The tolerant Condorcet points
• Multiple voting location and single voting location on trees

zbMATH Keywords

networklocationlinear algorithmobnoxious facilityanti-Condorcet pointvoting solution

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social choice (91B14) Inventory, storage, reservoirs (90B05)

Cites Work

• Title not available (Why is that?)

Cited In (11)

• Locating an obnoxious facility on a euclidean network to minimize neighborhood damage
• Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
• Sequential competitive location on networks
• OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
• Discrete facility location and routing of obnoxious activities.
• Outcomes of voting and planning in single facility location problems
• How bad can a voting locating be
• Location of an undesirable facility on a network: a bargaining approach
• Axiomatization and the antimean function on paths
• The tolerant Condorcet points
• Distance weighted voting and a single facility location problem

This page was built for publication: Location of an obnoxious facility on a network: A voting approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3032043)