Analysis of L-structure stability of convex integer programming problems
From MaRDI portal
Analysis of \(L\)-structure stability of convex integer programming problems
Recommendations
Cited in
(11)- Asymptotic behavior of integer programming and the stability of the Castelnuovo-Mumford regularity
- Analysis of integer programming algorithms with \(L\)-partition and unimodular transformations
- On the stability of some integer programming algorithms
- Stability analysis for \(L\)-partitions in a finite-dimensional space
- scientific article; zbMATH DE number 1985684 (Why is no real title available?)
- Estimation of the number of iterations in integer programming algorithms using the regular partitions method
- scientific article; zbMATH DE number 1882405 (Why is no real title available?)
- The analysis of the stability of some integer programming algorithms with respect to the objective function
- One approach to solving a discrete production planning problem with interval data
- Analysis of fractional covering of some supply management problems
- L-class enumeration algorithms for a discrete production planning problem with interval resource quantities
This page was built for publication: Analysis of \(L\)-structure stability of convex integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4789853)