The two-sided (max/min, plus) problem is NP-complete
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F17%3A50013527" target="_blank" >RIV/62690094:18450/17:50013527 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
The two-sided (max/min, plus) problem is NP-complete
Original language description
The two-sided (max/min,+) linear system of equations with real coeficients is considered. Recognizing the solvability of the system is shown to be an NP-complete problem. An application of the problem to the synchronization of cyclically repeated groups of activities with deterministic processing times is briefly discussed.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10102 - Applied mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 20th Czech-Japan Seminar on Data Analysis and Decision Making under Uncertainity
ISBN
978-80-7464-932-5
ISSN
—
e-ISSN
neuvedeno
Number of pages
8
Pages from-to
46-53
Publisher name
Ostravská univerzita
Place of publication
Ostrava
Event location
Pardubice
Event date
Sep 17, 2017
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000418391500005