scientific article; zbMATH DE number 1394671

From MaRDI portal
Publication:4934873

DOI<283::AID-NET8>3.0.CO;2-2 10.1002/(SICI)1097-0037(199912)34:4<283::AID-NET8>3.0.CO;2-2zbMath0948.90086MaRDI QIDQ4934873

Stefan Nickel, Justo Puerto

Publication date: 27 November 2000


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions, Worst-case incremental analysis for a class ofp-facility location problems, On the unified dispersion problem: efficient formulations and exact algorithms, Ordered median problem with demand distribution weights, An extended covering model for flexible discrete and equity location problems, Unreliable point facility location problems on networks, Locating hyperplanes to fitting set of points: a general framework, Extensive facility location problems on networks: an updated review, A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks, A comparative study of different formulations for the capacitated discrete ordered median problem, Minmax regret maximal covering location problems with edge demands, Review of obnoxious facilities location problems, The ordered capacitated facility location problem, A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm, On solving the planar \(k\)-centrum problem with Euclidean distances, A note on the nestedness property for ordered median problems in tree networks, The extensive 1-median problem with radius on networks, An inverse approach to convex ordered median problems in trees, Unnamed Item, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces, A generalized model of equality measures in network location problems, Fixed gate point location problems, A parallelized lagrangean relaxation approach for the discrete ordered median problem, A modified variable neighborhood search for the discrete ordered median problem, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, The ordered gradual covering location problem on a network, Locating tree-shaped facilities using the ordered median objective, Exact procedures for solving the discrete ordered median problem, Effectiveness-equity models for facility location problems on tree networks, Convex ordered median problem with \(\ell _p\)-norms, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Aggregation error for location models: Survey and analysis, A flexible model and efficient solution strategies for discrete location problems, Improved complexity results for several multifacility location problems on trees, The ordered \(k\)-median problem: surrogate models and approximation algorithms, On location-allocation problems for dimensional facilities, Distribution systems design with role dependent objectives, The \(p\)-facility ordered median problem on networks, Minimizing the sum of the \(k\) largest functions in linear time., Multicriteria planar ordered median problems, Algorithmic results for ordered median problems, On the exponential cardinality of FDS for the ordered \(p\)-median problem, Heuristic procedures for solving the discrete ordered median problem



Cites Work