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

MaRDI QIDQ5263835zbMATH OpenFDO

Authors Roman E. Shangin

Publication date 17 July 2015

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

zbMATH Keywords

\(n\)-sequentially connected chaindynamic programmingexact algorithmWeber problem

Mathematics Subject Classification ID

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

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

Cited in

(3)

• Algorithm for the discrete Weber's problem with an accuracy estimate
• scientific article; zbMATH DE number 6466099 (Why is no real title available?)
• Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle

Describes a project that uses

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)