On the Complexity of Postoptimality Analysis of 01 Programs

Discrete Applied Mathematics - Netherlands
doi 10.1016/s0166-218x(98)00151-6
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

Complexity and Resource Bound Analysis of Imperative Programs Using Difference Constraints

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2017English

Effect of the Complexity of Sunflower Growing Regions on the Genetic Progress Achieved by Breeding Programs

Helia
AgronomyCrop Science
2012English

Complexity of Nonrecursive Logic Programs With Complex Values

1998English

Analysing the Complexity of Functional Programs: Higher-Order Meets First-Order

ACM SIGPLAN Notices
Computer Science
2015English

Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming

Management Science
Management ScienceManagementOperations ResearchStrategy
1977English

Impact of Spatial Visualization Aptitude on WWW Navigation§~!2008-01-01~!2008-11-01~!2009-12-15~!

The Ergonomics Open Journal
2010English

Syntactic Complexity Metrics and the Readability of Programs in a Functional Computer Language

1992English

Static Analysis of Android Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy