An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems (Q2263220): 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: General approach to estimating the complexity of postoptimality analysis for discrete optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On estimates of the complexity of numerical characteristics of postoptimality analysis for discrete optimization problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computational Complexity / rank | |||
Normal rank | |||
Latest revision as of 20:59, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems |
scientific article |
Statements
An approach to estimating the complexity of probabilistic procedures for the postoptimality analysis of discrete optimization problems (English)
0 references
18 March 2015
0 references
0 references
