Pages that link to "Item:Q4934873"
From MaRDI portal
The following pages link to A unified approach to network location problems (Q4934873):
Displaying 50 items.
- A note on the nestedness property for ordered median problems in tree networks (Q394466) (← links)
- An inverse approach to convex ordered median problems in trees (Q421273) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem (Q512991) (← links)
- The ordered capacitated facility location problem (Q611009) (← links)
- A combinatorial algorithm for the 1-median problem in \(\mathbb R^d\) with the Chebyshev norm (Q613330) (← links)
- On solving the planar \(k\)-centrum problem with Euclidean distances (Q613427) (← links)
- On worst-case aggregation analysis for network location problems (Q689246) (← links)
- Strategy-proof location on a network (Q697960) (← links)
- Efficient algorithms for network localization using cores of underlying graphs (Q742409) (← links)
- Improved complexity results for several multifacility location problems on trees (Q763099) (← links)
- On the exponential cardinality of FDS for the ordered \(p\)-median problem (Q813976) (← links)
- Heuristic procedures for solving the discrete ordered median problem (Q816415) (← links)
- The ordered gradual covering location problem on a network (Q967440) (← links)
- Convex ordered median problem with \(\ell _p\)-norms (Q1013404) (← links)
- Aggregation error for location models: Survey and analysis (Q1026594) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- Distribution systems design with role dependent objectives (Q1039797) (← links)
- A location problem on unicyclic networks: Balanced case (Q1196028) (← links)
- Averaging the \(k\) largest distances among \(n\): \(k\)-centra in Banach spaces (Q1433355) (← links)
- Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions (Q1622795) (← links)
- Locating hyperplanes to fitting set of points: a general framework (Q1652646) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Minimizing the sum of the \(k\) largest functions in linear time. (Q1853685) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- General network design: a unified view of combined location and network design problems (Q1926688) (← links)
- Fixed gate point location problems (Q1979181) (← links)
- A modified variable neighborhood search for the discrete ordered median problem (Q2256171) (← links)
- The ordered \(k\)-median problem: surrogate models and approximation algorithms (Q2316614) (← links)
- On location-allocation problems for dimensional facilities (Q2317850) (← links)
- An extended covering model for flexible discrete and equity location problems (Q2379187) (← links)
- A unified model for Weber problems with continuous and network distances (Q2384880) (← links)
- A generalized model of equality measures in network location problems (Q2456627) (← links)
- Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
- The \(p\)-facility ordered median problem on networks (Q2568602) (← links)
- Multicriteria planar ordered median problems (Q2583208) (← links)
- On the unified dispersion problem: efficient formulations and exact algorithms (Q2629707) (← links)
- Ordered median problem with demand distribution weights (Q2629911) (← links)
- Unreliable point facility location problems on networks (Q2636810) (← links)
- A local analysis to determine all optimal solutions of \(p\)-\(k\)-\(\max\) location problems on networks (Q2664012) (← links)
- A comparative study of different formulations for the capacitated discrete ordered median problem (Q2664433) (← links)
- Minmax regret maximal covering location problems with edge demands (Q2668649) (← links)
- Review of obnoxious facilities location problems (Q2669654) (← links)
- Effectiveness-equity models for facility location problems on tree networks (Q2811312) (← links)
- (Q3316922) (← links)
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem (Q3386785) (← links)
- Solving Nonlinear Single-Facility Network Location Problems (Q3757657) (← links)
- Finite Dominating Sets for Network Location Problems (Q3981511) (← links)