Branch and bound method for problems of Euclidean combinato-rial optimization on combinations
Saved in:
| Date: | 2017 |
|---|---|
| Main Author: | A. O. Emets |
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Series: | International Scientific Technical Journal «Problems of Control and Informatics» |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001286297 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Journal Title: | Library portal of National Academy of Sciences of Ukraine | LibNAS |
Institution
Library portal of National Academy of Sciences of Ukraine | LibNASSimilar Items
-
Algorithm Solving the Problem of Optimal Function by Method of Branch and Bound
by: M. V. Leonova
Published: (2013) -
A dynamic branching based on nonlinear estimations in the branch and bound method
by: V. V. Boiko, et al.
Published: (2019) -
Surface and sombinatorial cuttings in euclidean combinatorial optimization problems
by: O. S. Pichugina
Published: (2016) -
Properties of Euclidean Problems of Lexicographic Combinatorial Optimization on Arrangements
by: T. M. Barbolina
Published: (2019) -
Method for the Solution of Systems of Bit Equations Based on Branch-and-Bound Principle
by: Yu. Semenov, et al.
Published: (2019)