Complexity of sensitivity analysis for discrete programming problems with Boolean variables
Saved in:
| Date: | 2015 |
|---|---|
| Main Author: | N. V. Lishchuk |
| Format: | Article |
| Language: | English |
| Published: |
2015
|
| Series: | Kompiuternaia matematyka |
| Online Access: | http://jnas.nbuv.gov.ua/article/UJRN-0001071519 |
| 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
-
The complexity of probabilistic sensitivity analysis procedures for integral Boolean programming problems
by: N. V. Lishchuk
Published: (2015) -
Resolution method for the analysis of sensitivity of 0-1 programming problems
by: V. A. Mikhajljuk, et al.
Published: (2017) -
Evolutionary Models Boolean Programming Problem
by: I. V. Kozin
Published: (2013) -
Parallel algorithms for solving the boolean quadratic programming problem
by: V. P. Shylo, et al.
Published: (2015) -
Fuzzy boolean variables and their applications
by: O. O. Provotar
Published: (2015)