scientific article; zbMATH DE number 6466099

MaRDI QIDQ5264741zbMATH OpenFDO

Authors A. V. Panyukov, Roman E. Shangin

Publication date 27 July 2015

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

zbMATH Keywords

dynamic programmingexact algorithmWeber problem\(k\)-treedecomposition tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Dynamic programming (90C39)

Recommendations

• Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle
• scientific article; zbMATH DE number 7310231
• On the existence of an integer solution to the relaxed Weber problem for a tree network
• On the existence of an integer solution of the relaxed Weber problem for a tree network
• A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain
• An algorithmic framework for the exact solution of tree-star problems
• Algorithm for the discrete Weber's problem with an accuracy estimate
• Polyhedral results and a branch-and-cut algorithm for the \(k\)-cardinality tree problem
• On Exact Algorithms for Treewidth

Cited in

(7)

• On the existence of an integer solution to the relaxed Weber problem for a tree network
• Optimal placement of rectangles on a plane with fixed objects
• Algorithm for the discrete Weber's problem with an accuracy estimate
• Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle
• A branch-and-price algorithm for the multi-source Weber problem
• On the existence of an integer solution of the relaxed Weber problem for a tree network
• A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication:

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