A matheuristic for locating obnoxious facilities

DOI10.1016/J.COR.2024.106602MaRDI QIDQ6568397zbMATH OpenFDO

Authors Tamara Bigler

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106602

zbMATH Keywords

combinatorial optimizationfacility locationmatheuristicmixed-integer programmingobnoxious facility

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A branch-and-cut method for the obnoxious \(p\)-median problem
• A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem
• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem
• Alternative formulations for the obnoxious \(p\)-median problem
• scientific article; zbMATH DE number 6381735 (Why is no real title available?)
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Local branching
• Location analysis: a synthesis and survey
• Obnoxious facility location in multiple dimensional space
• Obnoxious Facility Location on Graphs
• OBNOXIOUS FACILITY LOCATION: THE CASE OF WEIGHTED DEMAND POINTS
• On the unified dispersion problem: efficient formulations and exact algorithms
• Parallel iterative solution-based tabu search for the obnoxious \(p\)-median problem
• Progress in mathematical programming solvers from 2001 to 2020
• Review of obnoxious facilities location problems
• The obnoxious facilities planar \(p\)-median problem
• TSPLIB—A Traveling Salesman Problem Library

This page was built for publication: A matheuristic for locating obnoxious facilities

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