A branch-and-cut method for the obnoxious \(p\)-median problem

DOI10.1007/s10288-006-0023-3zbMath1145.90106OpenAlexW2150077073MaRDI QIDQ926563

Martine Labbé, Francesco Maffioli, Malick M. Ndiaye, Pietro Belotti

Publication date: 20 May 2008

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-006-0023-3

zbMATH Keywords

branch-and-cut\(p\)-medianobnoxious facility location

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items

The maximin HAZMAT routing problem, Capacitated \(p\)-center problem with failure foresight, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, A strengthened formulation for the simple plant location problem with order, Customer allocation in maximum capture problems, Facility location under service level constraints for heterogeneous customers, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, A parallel variable neighborhood search approach for the obnoxious p‐median problem, Closest assignment constraints in discrete location problems, Alternative formulations for the obnoxious \(p\)-median problem, Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem, A comparison of formulations and solution methods for the minimum-envy location problem, The conditional \(p\)-dispersion problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The discrete p-dispersion problem
• Analytical models for locating undesirable facilities
• On the exact solution of large-scale simple plant location problems
• A Lagrangean heuristic for the maximal covering location problem
• The obnoxious \(p\) facility network location problem with facility interaction
• An efficient genetic algorithm for the \(p\)-median problem
• Discrete facility location and routing of obnoxious activities.
• 2-medians in trees with pos/neg weights
• Solution of the cumulative assignment problem with a well-structured tabu search method
• The discrete p-maxian location problem
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• Obnoxious Facility Location on Graphs
• Technical Note—The Discrete Anti-P-Center Problem
• The maximin-maxisum network location problem
• A fractional model for locating semi-desirable facilities on networks