Analysis of L-Structure Stability of Convex Integer Programming Problems

Devyaterikova, M. V.; Колоколов, А. А.

doi:10.1007/978-3-642-56656-1_8

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2004

2009

Publication Types

Select...

Article4

Relationship

Self Cite0

Independent4

Authors

Journals

Cited by 4 publications

(2 citation statements)

References 3 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our approach [5,6] is similar to the one dealing with linear algebraic equations with interval coefficients [7]. Unlike this approach we find a solution of the interval ILP problem.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

L-class enumeration algorithms for a discrete production planning problem with interval resource quantities

Devyaterikova

Колоколов

Kolosov

2009

Computers & Operations Research

View full text Add to dashboard Cite

“…Our approach [5,6] is similar to the one dealing with linear algebraic equations with interval coefficients [7]. Unlike this approach we find a solution of the interval ILP problem.…”

Section: Introductionmentioning

confidence: 99%

“…Recently a new approach to stability analysis of the ILP problems based on the regular partitions has been suggested [19]. The stability of some ILP problems [6] and the stability of some ILP algorithms [20] were established.…”

Section: Introductionmentioning

confidence: 99%