Algorithm to solve a discrete minimax problem of the arrangement of physical field sources

DOI10.1007/S10559-009-9146-9zbMath1198.90267OpenAlexW2061921705MaRDI QIDQ844370

S. I. Yaremchuk, S. S. Matuschenko, P. V. Burda

Publication date: 19 January 2010

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9146-9

zbMATH Keywords

minimax problemtransportation problemplacearrangement optimization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Case-oriented studies in operations research (90B90) Discrete location and assignment (90B80)

Cites Work

• Efficiency of algorithms for solution of network problems with tree-like data structure
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithm to solve a discrete minimax problem of the arrangement of physical field sources