scientific article

From MaRDI portal
Publication:2708295

zbMath0974.90009MaRDI QIDQ2708295

Francisco Ramón Fernández García, Justo Puerto

Publication date: 16 December 2001


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



Related Items (26)

On \(k\) nearest points of a finite set in a normed linear spaceOrdered median problem with demand distribution weightsReduced pairs of compact convex sets and ordered median functionsThe nestedness property of location problems on the lineA comparative study of different formulations for the capacitated discrete ordered median problemRevisiting \(k\)-sum optimizationThe ordered capacitated facility location problemOrdered \(p\)-median problems with neighbourhoodsAn efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regionsRevisiting several problems and algorithms in continuous location with \(\ell _\tau \) normsAveraging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spacesOn the structure of the solution set for the single facility location problem with average distancesSingle-allocation ordered median hub location problemsSimultaneous scheduling and location (ScheLoc): The planar ScheLoc makespan problemExact procedures for solving the discrete ordered median problemCovering problems with polyellipsoids: a location analysis perspectiveConvex ordered median problem with \(\ell _p\)-normsA Branch-Price-and-Cut Procedure for the Discrete Ordered Median ProblemAggregation error for location models: Survey and analysisThe ordered \(k\)-median problem: surrogate models and approximation algorithmsDistribution systems design with role dependent objectivesThe \(p\)-facility ordered median problem on networksMinimizing the sum of the \(k\) largest functions in linear time.Algorithmic results for ordered median problemsOn the exponential cardinality of FDS for the ordered \(p\)-median problemHeuristic procedures for solving the discrete ordered median problem




This page was built for publication: