General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (Q1957000): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10559-010-9206-1 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2041528445 / rank | |||
Normal rank | |||
Revision as of 01:35, 20 March 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
General approach to estimating the complexity of postoptimality analysis for discrete optimization problems (English)
0 references
24 September 2010
0 references
polynomial algorithm
0 references
polynomially solvable problem
0 references
