The theory of convex extensions in combinatorial optimization problems
Saved in:
| Date: | 2017 |
|---|---|
| Main Author: | S. V. Jakovlev |
| Format: | Article |
| Language: | English |
| Published: |
2017
|
| Series: | Reports of the National Academy of Sciences of Ukraine |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0000821490 |
| 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
-
Continuous representations and functional extensions in combinatorial optimization
by: O. S. Pichugina, et al.
Published: (2016) -
Convex extensions for the quadratic problems over permutation matrices
by: O. S. Pichugina, et al.
Published: (2016) -
Theory and methods of Euclidian combinatorial optimization: current state and prospects
by: Ju. G. Stojan, et al.
Published: (2020) -
On a combinatorial structure of the problems of optimal packing of geometric objects
by: S. V. Jakovlev
Published: (2017) -
Properties of combinatorial optimization problems over polyhedral-spherical sets
by: S. V. Jakovlev, et al.
Published: (2018)