An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems (Q464980): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Victor A. Mikhailyuk / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q17 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6362614 / rank
 
Normal rank
Property / zbMATH Keywords
 
postoptimality analysis
Property / zbMATH Keywords: postoptimality analysis / rank
 
Normal rank
Property / zbMATH Keywords
 
polynomiality on average with respect to \(\mu\)
Property / zbMATH Keywords: polynomiality on average with respect to \(\mu\) / rank
 
Normal rank
Property / author
 
Property / author: Victor A. Mikhailyuk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10559-011-9366-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2025873233 / rank
 
Normal rank
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: Average case completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the theory of average case complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Case Complete Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5724253 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:13, 9 July 2024

scientific article
Language Label Description Also known as
English
An approach to estimating the average-case complexity of postoptimality analysis of discrete optimization problems
scientific article

    Statements

    Identifiers