Pages that link to "Item:Q5378793"
From MaRDI portal
The following pages link to Link-Length Minimization in Networks (Q5378793):
Displaying 42 items.
- Backup multifacility location problem with \(l_p\) norm (Q260687) (← links)
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- The neglected pillar of material computation (Q933423) (← links)
- The inverse Fermat-Weber problem (Q976390) (← links)
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem (Q980366) (← links)
- The complexity of analog computation (Q1077163) (← links)
- The effect of ignoring routes when locating depots (Q1111927) (← links)
- The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829 (Q1119557) (← links)
- Optimal location on a sphere (Q1148106) (← links)
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle (Q1148209) (← links)
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree (Q1178313) (← links)
- An optimal method for solving the (generalized) multi-Weber problem (Q1197648) (← links)
- A nonlinear optimization approach for solving facility layout problems (Q1197687) (← links)
- When facilities coincide: Exact optimality conditions in multifacility location (Q1209505) (← links)
- Normative location theory: Placement in continuous space (Q1237028) (← links)
- Incorporating market characteristics into physical distribution models (Q1247362) (← links)
- An efficient algorithm for facility location in the presence of forbidden regions (Q1266516) (← links)
- A globally convergent algorithm for facility location on a sphere (Q1323619) (← links)
- Semi-obnoxious single facility location in Euclidean space. (Q1422376) (← links)
- A note on convergence in the single facility minisum location problem (Q1608453) (← links)
- A variational inequality approach for constrained multifacility Weber problem under gauge (Q1717019) (← links)
- A sequential Bayesian alternative to the classical parallel fuzzy clustering model (Q1749943) (← links)
- Location analysis: a synthesis and survey (Q1776950) (← links)
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms (Q1782170) (← links)
- A direct solution of allocation problems (Q1903256) (← links)
- Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference (Q2013754) (← links)
- Modeling of optimal networks by means of linkages (Q2055321) (← links)
- ADMM-type methods for generalized multi-facility Weber problem (Q2076464) (← links)
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy (Q2165280) (← links)
- Single facility siting involving allocation decisions (Q2178111) (← links)
- Weiszfeld's method: old and new results (Q2260646) (← links)
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks (Q2379703) (← links)
- The generalized Fermat-Torricelli problem in Hilbert spaces (Q2679558) (← links)
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem (Q2679571) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- A Case Study for a Location-Routing Problem (Q5232829) (← links)
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities (Q6053498) (← links)
- A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems (Q6157934) (← links)
- Distributionally robust Weber problem with uncertain demand (Q6175466) (← links)
- (Q6179336) (← links)
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem (Q6659120) (← links)