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

DOI10.1134/S0005117916070079zbMath1354.90067MaRDI QIDQ329214

A. V. Panyukov, Roman E. Shangin

Publication date: 21 October 2016

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

zbMATH Keywords

quadratic assignmentpolynomial algorithmsimple loop

Mathematics Subject Classification ID

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

Related Items (1)

Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On approximating the memory-constrained module allocation problem
• A study of the quadratic semi-assignment polytope
• Schedule synchronization for public transit networks
• Polynomial algorithms to finite Veber problem for a tree network
• A polynomially solvable class of quadratic semi-assignment problems
• Lower bounds for the quadratic semi-assignment problem
• The quadratic assignment problem. I: New lower bounds in paired assignment
• The quadratic assignment problem. II: Refined Gilmore-Lawler algorithm
• Dynamic programming for the quadratic assignment problem on trees
• P-Complete Approximation Problems
• Multiprocessor Scheduling with the Aid of Network Flow Algorithms

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