Discrete location problems with push-pull objectives

DOI10.1016/S0166-218X(01)00346-8zbMath1012.90028WikidataQ58826466 ScholiaQ58826466MaRDI QIDQ697575

Jakob Krarup, Frank Plastria, David Pisinger

Publication date: 17 September 2002

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

zbMATH Keywords

combinatorial optimisation

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (14)

A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint ⋮ Novel dual discounting functions for the Internet shopping optimization problem: new algorithms ⋮ Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs ⋮ Solving \(k\)-cluster problems to optimality with semidefinite programming ⋮ A modified optimal algorithm for 2-maxian location problems on cactus graphs ⋮ Locating a semi-obnoxious covering facility with repelling polygonal regions ⋮ Internet shopping with price sensitive discounts ⋮ Reverse 1-maxian problem with keeping existing 1-median ⋮ The \(p\)-maxian problem on a tree ⋮ Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network ⋮ A polynomial method for the pos/neg weighted 3-median problem on a tree ⋮ Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

Uses Software

• Knapsack

Cites Work

• A multiobjective model for locating undesirable facilities
• The discrete p-dispersion problem
• Constrained global optimization: algorithms and applications
• Analytical models for locating undesirable facilities
• An exact algorithm for large multiple knapsack problems
• Equity measurement in facility location analysis: A review and framework
• Bicriteria and restricted 2-facility Weber problems
• The quadratic assignment problem. Theory and algorithms
• A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
• 2-medians in trees with pos/neg weights
• Robust location problems with pos/neg weights on a tree
• An Analysis of Network Location Problems with Distance Constraints
• Quadratic knapsack problems
• Heuristic and Special Case Algorithms for Dispersion Problems
• Exact Solution of the Quadratic Knapsack Problem
• Quadratic knapsack relaxations using cutting planes and semidefinite programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Discrete location problems with push-pull objectives