Link-Length Minimization in Networks

DOI10.1287/opre.6.2.232zbMath1414.90068OpenAlexW2157700603MaRDI QIDQ5378793

William Miehle

Publication date: 3 June 2019

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.6.2.232

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Related Items (39)

The complexity of analog computation ⋮ A direct solution of allocation problems ⋮ Accelerating convergence in minisum location problem with \(\ell p\) norms ⋮ The effect of ignoring routes when locating depots ⋮ Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy ⋮ The earliest contribution to location theory? Spatio-economic equilibrium with Lamé and Clapeyron, 1829 ⋮ Single facility siting involving allocation decisions ⋮ A Variational Inequality-Based Location-Allocation Algorithm for Locating Multiple Interactive Facilities ⋮ The generalized Fermat-Torricelli problem in Hilbert spaces ⋮ Customized alternating direction methods of multipliers for generalized multi-facility Weber problem ⋮ A fast inertial primal-dual algorithm to composite optimization models with application to image restoration problems ⋮ 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 ⋮ Distributionally robust Weber problem with uncertain demand ⋮ Semi-obnoxious single facility location in Euclidean space. ⋮ A variational inequality approach for constrained multifacility Weber problem under gauge ⋮ Unnamed Item ⋮ The neglected pillar of material computation ⋮ A fixed point algorithm for solving the Euclidean multifacility location problem in a tree ⋮ A sequential Bayesian alternative to the classical parallel fuzzy clustering model ⋮ 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 ⋮ Weiszfeld's method: old and new results ⋮ Rederivation of the fuzzy-possibilistic clustering objective function through Bayesian inference ⋮ Facility location models for distribution system design ⋮ The inverse Fermat-Weber problem ⋮ A Weiszfeld algorithm for the solution of an asymmetric extension of the generalized Fermat location problem ⋮ Location analysis: a synthesis and survey ⋮ A continuous approximation approach to the planar hub location-routing problem: modeling and solution algorithms ⋮ 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 ⋮ Computational Complexity in Non-Turing Models of Computation ⋮ A Case Study for a Location-Routing Problem ⋮ ADMM-type methods for generalized multi-facility Weber problem ⋮ A note on convergence in the single facility minisum location problem ⋮ A globally convergent algorithm for facility location on a sphere ⋮ Backup multifacility location problem with \(l_p\) norm

This page was built for publication: Link-Length Minimization in Networks