Algorithm for the discrete Weber's problem with an accuracy estimate

DOI10.1134/S0005117916070079MaRDI QIDQ329214zbMATH OpenFDO

Authors A. V. Panyukov, Roman E. Shangin

Publication date 21 October 2016

Published in Automation and Remote Control (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmquadratic assignmentsimple loop

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• scientific article; zbMATH DE number 6466099
• Exact and heuristic algorithms for solving the discrete Weber problem for a simple cycle
• A contribution to quadratic assignment problems
• scientific article; zbMATH DE number 3869027
• Adaptation of the probability changing method for Weber problem with an arbitrary metric

Cites work

• scientific article; zbMATH DE number 3664741 (Why is no real title available?)
• scientific article; zbMATH DE number 1894381 (Why is no real title available?)
• scientific article; zbMATH DE number 6466099 (Why is no real title available?)
• A deterministic algorithm for solving the Weber problem for an \(n\)-sequentially connected chain
• A polynomially solvable class of quadratic semi-assignment problems
• A study of the quadratic semi-assignment polytope
• Dynamic programming for the quadratic assignment problem on trees
• Lower bounds for the quadratic semi-assignment problem
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms
• On approximating the memory-constrained module allocation problem
• On the shortest spanning subtree of a graph and the traveling salesman problem
• P-Complete Approximation Problems
• Polynomial algorithms to finite Veber problem for a tree network
• Schedule synchronization for public transit networks
• The quadratic assignment problem. I: New lower bounds in paired assignment
• The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm

Cited in

(4)

• Jebelean-Weber's algorithm without spurious factors
• scientific article; zbMATH DE number 1460260 (Why is no real title available?)
• scientific article; zbMATH DE number 6466099 (Why is no real title available?)
• Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search

This page was built for publication: Algorithm for the discrete Weber's problem with an accuracy estimate

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