scientific article; zbMATH DE number 1394671
From MaRDI portal
Publication:4934873
DOI10.1002/(SICI)1097-0037(199912)34:4%3C283::AID-NET8%3E3.0.CO;2-2zbMATH Open0948.90086MaRDI QIDQ4934873FDOQ4934873
Authors: S. Nickel, Justo Puerto 
Publication date: 27 November 2000
Title of this publication is not available (Why is that?)
Recommendations
Cites Work
Cited In (56)
- The extensive 1-median problem with radius on networks
- A note on the nestedness property for ordered median problems in tree networks
- Effectiveness-equity models for facility location problems on tree networks
- Exact procedures for solving the discrete ordered median problem
- Multicriteria planar ordered median problems
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Locating tree-shaped facilities using the ordered median objective
- Title not available (Why is that?)
- Title not available (Why is that?)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions
- An inverse approach to convex ordered median problems in trees
- Extensive facility location problems on networks: an updated review
- The ordered gradual covering location problem on a network
- A Computational Geometry Framework for Efficient Network Localization
- On Local Search and Placement of Meters in Networks
- Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces
- Minmax regret maximal covering location problems with edge demands
- Strategy-proof location on a network
- Locating hyperplanes to fitting set of points: a general framework
- The ordered capacitated facility location problem
- Equivalence of Solutions to Network Location Problems
- General network design: a unified view of combined location and network design problems
- Review of obnoxious facilities location problems
- A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm
- Efficient algorithms for network localization using cores of underlying graphs
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks
- Unreliable point facility location problems on networks
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Heuristic procedures for solving the discrete ordered median problem
- On the exponential cardinality of FDS for the ordered \(p\)-median problem
- Ordered median problem with demand distribution weights
- Distribution systems design with role dependent objectives
- The \(p\)-facility ordered median problem on networks
- Improved complexity results for several multifacility location problems on trees
- On solving the planar \(k\)-centrum problem with Euclidean distances
- Solving Nonlinear Single-Facility Network Location Problems
- On worst-case aggregation analysis for network location problems
- Aggregation error for location models: Survey and analysis
- A flexible model and efficient solution strategies for discrete location problems
- Worst-case incremental analysis for a class ofp-facility location problems
- A comparative study of different formulations for the capacitated discrete ordered median problem
- Convex ordered median problem with \(\ell _p\)-norms
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Algorithmic results for ordered median problems
- A location problem on unicyclic networks: Balanced case
- A generalized model of equality measures in network location problems
- On location-allocation problems for dimensional facilities
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- Minimizing the sum of the \(k\) largest functions in linear time.
- An extended covering model for flexible discrete and equity location problems
- A unified model for Weber problems with continuous and network distances
- Title not available (Why is that?)
- A modified variable neighborhood search for the discrete ordered median problem
- Fixed gate point location problems
- On the unified dispersion problem: efficient formulations and exact algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4934873)
