A direct solution of allocation problems

DOI10.1016/0307-904X(91)90063-UMaRDI QIDQ1903256zbMATH OpenOpenAlexFDO

Authors Francesco Mocci, M. P. Tosi

Publication date 26 November 1995

Published in Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0307-904x(91)90063-u

zbMATH Keywords

auxiliary junctionsconnection networkelectric distribution networksoptimum locationSteiner minimal treestree-structured networks

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Recommendations

• Interconnecting networks in the plane: The steiner case
• Augmenting Euclidean Networks—the Steiner Case
• On the solution of the generalized steiner problem by the subgradient method
• scientific article; zbMATH DE number 1156670
• An algorithm for the steiner problem in the euclidean plane

Cites work

• A Geometrical Solution of the Three Factory Problem
• scientific article; zbMATH DE number 3508189 (Why is no real title available?)
• scientific article; zbMATH DE number 3401212 (Why is no real title available?)
• Link-Length Minimization in Networks
• Location-Allocation Problems
• Steiner Minimal Trees

Cited in

(8)

• Efficient allocation with continuous quantities
• A correcting algorithm for solving allocation type problems
• A Steiner arborescence model for the feeder reconfiguration in electric distribution networks
• A solvable routing problem
• Résolution directe du problème général de distribution
• scientific article; zbMATH DE number 1336315 (Why is no real title available?)
• scientific article; zbMATH DE number 1353830 (Why is no real title available?)
• On the existence of an integer solution of the relaxed Weber problem for a tree network

This page was built for publication: A direct solution of allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903256)