An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps

DOI10.1134/S1990478916010154zbMath1349.90639OpenAlexW2326531884MaRDI QIDQ3186858

Gennady Grigorjevich Zabudsky, Natalia Sergeevna Veremchuk

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478916010154

zbMATH Keywords

location problemapproximate solutioninterconnected objects

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Related Items (1)

Optimization of location of interconnected facilities on parallel lines with forbidden zones

Cites Work

• Concurrent placement and routing in the design of integrated circuits
• Effective algorithm for the weber problem with a rectangular metric
• One-Dimensional Space Allocation: An Ordering Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An algorithm for finding an approximate solution to the Weber problem on a line with forbidden gaps