Alternative formulations for the obnoxious \(p\)-median problem

DOI10.1016/j.dam.2020.11.002zbMath1456.90099OpenAlexW3108948774MaRDI QIDQ2217491

Yen-I Chiang, Chang-Chun Lin

Publication date: 29 December 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.11.002

zbMATH Keywords

combinatorial optimizationfacility location problemobnoxious facility

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80) Boolean programming (90C09)

Cites Work

• Unnamed Item
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
• A new model for the hazardous waste location-routing problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• A branch-and-cut method for the obnoxious \(p\)-median problem
• A flexible model and efficient solution strategies for discrete location problems
• Analytical models for locating undesirable facilities
• Integer programming formulations of discrete hub location problems
• Discrete facility location and routing of obnoxious activities.
• Minimizing the sum of the \(k\) largest functions in linear time.
• A fresh view on the discrete ordered median problem based on partial monotonicity
• Exact procedures for solving the discrete ordered median problem
• Public facility location using dispersion, population, and equity criteria
• On the unified dispersion problem: efficient formulations and exact algorithms
• A New Formulation and Resolution Method for the p-Center Problem
• An Analysis of Network Location Problems with Distance Constraints
• Comparison Of Four Models For dispersing Facilities
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• A Canonical Representation of Simple Plant Location Problems and Its Applications

This page was built for publication: Alternative formulations for the obnoxious \(p\)-median problem