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

DOI10.1007/S10559-009-9146-9zbMATH Open1198.90267OpenAlexW2061921705MaRDI QIDQ844370FDOQ844370

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

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

Recommendations

• The minimax problem solving of physical fields sources allocation in specified positions
• Problem of optimal placement of discrete physical field sources
• A special class of problems of geometric optimization
• Optimal placement of sources for stationary scalar fields
• Оптимальное расположение источников тепла внутри областей сложной геометрической формы

zbMATH Keywords

transportation problemminimax problemplacearrangement optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficiency of algorithms for solution of network problems with tree-like data structure

Cited In (3)

• The minimax problem solving of physical fields sources allocation in specified positions
• Problem of optimal placement of discrete physical field sources
• Optimal placement of sources for stationary scalar fields

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

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