A deterministic algorithm for solving the Weber problem for an n-sequentially connected chain

zbMATH Open1324.90110MaRDI QIDQ5263835FDOQ5263835

Authors: Roman E. Shangin 

Publication date: 17 July 2015

Full work available at URL: http://mathnet.ru/eng/da748

Recommendations

• Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle
• scientific article; zbMATH DE number 6466099
• scientific article; zbMATH DE number 3869027
• scientific article; zbMATH DE number 4066586
• scientific article; zbMATH DE number 1803754

zbMATH Keywords

dynamic programmingexact algorithmWeber problem\(n\)-sequentially connected chain

Mathematics Subject Classification ID

Linear programming (90C05) Dynamic programming (90C39) Integer programming (90C10) Discrete location and assignment (90B80)

Cited In (2)

• Title not available (Why is that?)
• Algorithm for the discrete Weber's problem with an accuracy estimate

Uses Software

• CPLEX

This page was built for publication: A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain

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