Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61384399%3A31110%2F19%3A00052277" target="_blank" >RIV/61384399:31110/19:00052277 - isvavai.cz</a>
Alternative codes found
RIV/00216208:11320/19:10397334
Result on the web
<a href="https://link.springer.com/article/10.1007%2Fs11590-018-1289-z" target="_blank" >https://link.springer.com/article/10.1007%2Fs11590-018-1289-z</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s11590-018-1289-z" target="_blank" >10.1007/s11590-018-1289-z</a>
Alternative languages
Result language
angličtina
Original language name
Testing weak optimality of a given solution in interval linear programming revisited: NP-hardness proof, algorithm and some polynomially-solvable cases
Original language description
Main topics of the document: interval linear programming; weakly optimal solution; weak optimality testing
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10103 - Statistics and probability
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2019
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
Name of the periodical
Optimization Letters
ISSN
1862-4472
e-ISSN
1862-4480
Volume of the periodical
13
Issue of the periodical within the volume
4
Country of publishing house
DE - GERMANY
Number of pages
16
Pages from-to
875-890
UT code for WoS article
000467500700016
EID of the result in the Scopus database
2-s2.0-85049142063