Discrete facility location and routing of obnoxious activities.
From MaRDI portal
Publication:1417557
DOI10.1016/S0166-218X(03)00431-1zbMath1053.90077OpenAlexW2164976179MaRDI QIDQ1417557
Francesco Maffioli, Paola Cappanera, Giorgio Gallo
Publication date: 5 January 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(03)00431-1
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- Unnamed Item
- Analytical models for locating undesirable facilities
- The regional urban solid waste management system: A modelling approach
- On the approximation of the minimum disturbance \(p\)-facility location problem
- Discrete facility location and routing of obnoxious activities.
- A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Dual-ascent methods for large-scale multicommodity flow problems
Related Items (38)
Packing two disks in a polygon ⋮ Distribution network design on the battlefield ⋮ A survey of recent research on location-routing problems ⋮ A linear time algorithm for inverse obnoxious center location problems on networks ⋮ Robust facility location problem for hazardous waste transportation ⋮ On the approximation of the minimum disturbance \(p\)-facility location problem ⋮ Computing median and antimedian sets in median graphs ⋮ Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem ⋮ Robust efficiency measures for linear knapsack problem variants ⋮ Hazardous waste management problem: the case for incineration ⋮ Location-routing: issues, models and methods ⋮ Reverse selective obnoxious center location problems on tree graphs ⋮ An exact solution approach for multi-objective location-transportation problem for disaster response ⋮ A solution method for a two-layer sustainable supply chain distribution model ⋮ Multiobjective programming for sizing and locating biogas plants: a model and an application in a region of Portugal ⋮ Optimal approaches for upgrading selective obnoxious \(p\)-median location problems on tree networks ⋮ Locating landfills--optimization vs. reality ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ An agent-based framework for modeling and solving location problems ⋮ Optimal algorithms for inverse vertex obnoxious center location problems on graphs ⋮ When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners ⋮ Combinatorial algorithms for reverse selective undesirable center location problems on cycle graphs ⋮ Discrete facility location and routing of obnoxious activities. ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ Combinatorial algorithms for some variants of inverse obnoxious median location problem on tree networks ⋮ A stochastic multi-period industrial hazardous waste location-routing problem: integrating NSGA-II and Monte Carlo simulation ⋮ Design of a reliable multi-modal multi-commodity model for hazardous materials transportation under uncertainty ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ On the remoteness function in median graphs ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools ⋮ Simultaneous embeddings of graphs as median and antimedian subgraphs ⋮ Optimal algorithms for integer inverse undesirable \(p\)-median location problems on weighted extended star networks ⋮ Linear time optimal approaches for reverse obnoxious center location problems on networks ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ About Lagrangian methods in integer optimization
Uses Software
This page was built for publication: Discrete facility location and routing of obnoxious activities.
