General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Stability, parametric, and postoptimality analysis of discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Postoptimality analysis in zero‐one programming by implicit enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4377042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some concepts of stability analysis in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a quantitative measure of stability for a vector problem in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of postoptimality analysis of \(0/1\) programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank

Latest revision as of 06:47, 3 July 2024

scientific article
Language Label Description Also known as
English
General approach to estimating the complexity of postoptimality analysis for discrete optimization problems
scientific article

    Statements