Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Refined proximity and sensitivity results in linearly constrained convex separable integer programming |
scientific article; zbMATH DE number 803752
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Refined proximity and sensitivity results in linearly constrained convex separable integer programming |
scientific article; zbMATH DE number 803752 |
Statements
Refined proximity and sensitivity results in linearly constrained convex separable integer programming (English)
0 references
9 October 1995
0 references
measure of the structure of a linear constraint matrix
0 references
proximity
0 references
sensitivity
0 references
linearly constrained convex separable programming
0 references
integer nonlinear programming
0 references
0 references
0.9331472
0 references
0.89892983
0 references
0.8889863
0 references
0.8882288
0 references
0.8880018
0 references
0.87925553
0 references
0.87898064
0 references
0.8764413
0 references
