Link-Length Minimization in Networks
From MaRDI portal
Recommendations
- Minimum-link paths revisited
- Minimal cost linkages in graphs
- Minimizing the diameter of a network using shortcut edges
- On length-minimizing Steiner networks
- On the complexity of minimum-link path problems
- scientific article; zbMATH DE number 6707504
- On links minimizing the tunnel number
- Computing optimal shortcuts for networks
- Computing optimal shortcuts for networks
- scientific article; zbMATH DE number 1182917
Cited in
(44)- The complexity of analog computation
- The effect of ignoring routes when locating depots
- The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829
- Optimal location on a sphere
- Facility location in the presence of forbidden regions. I: Formulation and the case of Euclidean distance with one forbidden circle
- A fixed point algorithm for solving the Euclidean multifacility location problem in a tree
- An optimal method for solving the (generalized) multi-Weber problem
- A nonlinear optimization approach for solving facility layout problems
- When facilities coincide: Exact optimality conditions in multifacility location
- Normative location theory: Placement in continuous space
- Incorporating market characteristics into physical distribution models
- An efficient algorithm for facility location in the presence of forbidden regions
- A globally convergent algorithm for facility location on a sphere
- Semi-obnoxious single facility location in Euclidean space.
- A note on convergence in the single facility minisum location problem
- A variational inequality approach for constrained multifacility Weber problem under gauge
- A sequential Bayesian alternative to the classical parallel fuzzy clustering model
- Location analysis: a synthesis and survey
- A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms
- A direct solution of allocation problems
- Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference
- Modeling of optimal networks by means of linkages
- ADMM-type methods for generalized multi-facility Weber problem
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
- Single facility siting involving allocation decisions
- Weiszfeld's method: old and new results
- Analysis of shortest paths and subscriber line lengths in telecommunication access networks
- Backup multifacility location problem with \(l_p\) norm
- The generalized Fermat-Torricelli problem in Hilbert spaces
- Customized alternating direction methods of multipliers for generalized multi-facility Weber problem
- Computational complexity in non-Turing models of computation: the what, the why and the how
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- A Case Study for a Location-Routing Problem
- A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities
- A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems
- Distributionally robust Weber problem with uncertain demand
- An initial study of budgeted Steiner networks
- Second-order cone programming models for the unitary weighted Weber problem and for the minimum sum of the squares clustering problem
- Reviewing extensions and solution methods of the planar Weber single facility location problem
- Fifty years of location theory -- a selective review
- Facility location models for distribution system design
- The neglected pillar of material computation
- The inverse Fermat-Weber problem
- A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem
This page was built for publication: Link-Length Minimization in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378793)
