exchange algorithm of biextremal solution to homogeneous allocation problem
Clicks: 254
ID: 147412
2018
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
30.0
/100
254 views
34 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #10 of 15 articles by views in journal of the air pollution control association
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
An effective algorithm of constructing optimal solutions to homogeneous allocation problems is developed. It is called a biextremal solution algorithm because it permits to find the distribution carrying an extremum to two popular distribution evaluations simultaneously: uniformity of distribution criterion and minimax criterion. The principle of its operation consists in formalizing structure transformation of the core-image matrix derived by Romanovsky’s algorithm with further formalized rearrangement of tasks between their executors. An example of incremental solution to the particular problem is provided.
| Reference Key |
neydorf2018exchange
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Rudolph A. Neydorf;Anton V. Filippov;Zafar Khangusein-ogly Yagubov |
| Journal | journal of the air pollution control association |
| Year | 2018 |
| DOI |
DOI not found
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.