Discrete location problems with push-pull objectives
From MaRDI portal
Publication:697575
DOI10.1016/S0166-218X(01)00346-8zbMATH Open1012.90028WikidataQ58826466 ScholiaQ58826466MaRDI QIDQ697575FDOQ697575
Authors: Jakob Krarup, David Pisinger, Frank Plastria 
Publication date: 17 September 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- Methods for a class of discrete location problems
- The discrete p-maxian location problem
- scientific article; zbMATH DE number 6006831
- Closest assignment constraints in discrete location problems
- A flexible model and efficient solution strategies for discrete location problems
- A flexible model and efficient solution strategies for discrete location problems
- Probabilistic location problems with discrete demand weights
- Discrete Monotonic Optimization with Application to a Discrete Location Problem
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- A discrete location problem
Cites Work
- An exact algorithm for large multiple knapsack problems
- Title not available (Why is that?)
- Constrained global optimization: algorithms and applications
- The quadratic assignment problem. Theory and algorithms
- Title not available (Why is that?)
- Quadratic knapsack problems
- Title not available (Why is that?)
- Equity measurement in facility location analysis: A review and framework
- Analytical models for locating undesirable facilities
- Title not available (Why is that?)
- Title not available (Why is that?)
- A linear algorithm for the pos/neg-weighted 1-median problem on a cactus
- An Analysis of Network Location Problems with Distance Constraints
- Title not available (Why is that?)
- The discrete p-dispersion problem
- Title not available (Why is that?)
- Heuristic and Special Case Algorithms for Dispersion Problems
- Exact Solution of the Quadratic Knapsack Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- 2-medians in trees with pos/neg weights
- Robust location problems with pos/neg weights on a tree
- A multiobjective model for locating undesirable facilities
- Bicriteria and restricted 2-facility Weber problems
- Title not available (Why is that?)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming
Cited In (15)
- The \(p\)-maxian problem on a tree
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Reverse 1-maxian problem with keeping existing 1-median
- Overcoming human trafficking via operations research and analytics: opportunities for methods, models, and applications
- A modified optimal algorithm for 2-Maxian location problems on cactus graphs
- Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
- Internet shopping with price sensitive discounts
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
- A polynomial method for the pos/neg weighted 3-median problem on a tree
- Hybrid biobjective evolutionary algorithms for the design of a hospital waste management network
- A flexible model and efficient solution strategies for discrete location problems
- A linear time algorithm for the \(p\)-maxian problem on trees with distance constraint
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Solving \(k\)-cluster problems to optimality with semidefinite programming
- Locating a semi-obnoxious covering facility with repelling polygonal regions
Uses Software
This page was built for publication: Discrete location problems with push-pull objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697575)
