Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle

zbMATH Open1349.90826MaRDI QIDQ5741364FDOQ5741364

Authors: Roman E. Shangin 

Publication date: 22 July 2016

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

Recommendations

• scientific article; zbMATH DE number 6466099
• A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain
• scientific article; zbMATH DE number 3869027
• On an extension of Weber problem with Euclidean distance
• An optimal method for solving the (generalized) multi-Weber problem

zbMATH Keywords

dynamic programmingexact algorithmheuristic algorithmlocation problemWeber problemsimple cycle

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cited In (4)

• Exact Solution Algorithms for the Chordless Cycle Problem
• Title not available (Why is that?)
• Algorithm for the discrete Weber's problem with an accuracy estimate
• A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain

This page was built for publication: Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle

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