Discrete location problems with push-pull objectives

Authors:
Jakob Krarup;David Pisinger;Frank Plastria
Affiliations:
DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark;DIKU, Department of Computer Science, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark;BEIF, Vrije Universiteit Brussel, Pleinlaan 2, B-1050 Brussels, Belgium
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 7
Cited 6

Constrained global optimization: algorithms and applications

Constrained global optimization: algorithms and applications
A multiobjective model for locating undesirable facilities

Annals of Operations Research - Special issue on locational decisions
A linear algorithm for the pos/neg-weighted 1-median problem on a cactus

Computing
2-medians in trees with pos/neg weights

Discrete Applied Mathematics
Quadratic Knapsack Relaxations Using Cutting Planes

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Finding Dense Subgraphs with Semidefinite Programming

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
Exact Solution of the Quadratic Knapsack Problem

INFORMS Journal on Computing

Upper bounds and exact algorithms for p-dispersion problems

Computers and Operations Research
Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Discrete Applied Mathematics
Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network

Journal of Heuristics
Upper bounds and exact algorithms for p-dispersion problems

Computers and Operations Research
The p-maxian problem on a tree

Operations Research Letters
Locating a semi-obnoxious covering facility with repelling polygonal regions

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

The models within operational research concerned with locational decisions mostly either consider only the positive effects, pulling the facilities towards demand, or only negative effects, pushing the facilities away from the places affected by the facilities' nearness. In real-world situations both of these opposing forces are at work. We give an overview of a number of push-pull models, yielding alternative ways to incorporate both types of effects simultaneously. The discussion is restricted to models of combinatorial optimisation and includes indications of reduction to standard models and/or algorithmic approaches where possible.