Algorithm to solve a discrete minimax problem of the arrangement of physical field sources (Q844370)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Algorithm to solve a discrete minimax problem of the arrangement of physical field sources |
scientific article; zbMATH DE number 5660055
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm to solve a discrete minimax problem of the arrangement of physical field sources |
scientific article; zbMATH DE number 5660055 |
Statements
Algorithm to solve a discrete minimax problem of the arrangement of physical field sources (English)
0 references
19 January 2010
0 references
The authors propose an approximation algorithm for a special minimax assignment problem which arises when you have to place a certain number of elements (heat sources) on a wire-circuit board aiming to minimize the maximum temperature at a finite set of test points. The problem is formulated as a finite set of assignment problems with identical set of feasible solutions where the maximum value of the different objective functions has to be minimized. Using well-known facts of transportation problems an iterative improvement algorithm is developed by use of potentials related to base solutions. Approximation guarantees are only given with respect to the relaxed integer programming problem.
0 references
arrangement optimization
0 references
transportation problem
0 references
place
0 references
minimax problem
0 references
0 references
