Refined proximity and sensitivity results in linearly constrained convex separable integer programming
type: Item
instance of: scholarly article
title: Refined proximity and sensitivity results in linearly constrained convex separable integer programming
zbMATH Open document ID: 0838.90083
DOI: 10.1016/0024-3795(95)00172-N
author: Ross Baldick
published in: Linear Algebra and its Applications
publication date: 1995-10-09T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 803752
zbMATH Keywords: measure of the structure of a linear constraint matrix
zbMATH Keywords: proximity
zbMATH Keywords: sensitivity
zbMATH Keywords: linearly constrained convex separable programming
zbMATH Keywords: integer nonlinear programming
Wikidata QID: Q114852061
MaRDI profile type: Publication
cites work: Sensitivity theorems in integer linear programming
cites work: Q3818127
cites work: Some proximity and sensitivity results in quadratic integer programming
cites work: Convex separable optimization is not much harder than linear optimization
cites work: The relationship between integer and real solutions of constrained convex programming
cites work: A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization
cites work: Q4001658
cites work: Degree-two Inequalities, Clique Facets, and Biperfect Graphs
cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
cites work: Q4739657
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
Recommended article: Tightness of sensitivity and proximity bounds for integer linear programs
Recommended article: Some proximity and sensitivity results in quadratic integer programming
Recommended article: Q3682243
Recommended article: Proximity in concave integer quadratic programming
Recommended article: Sensitivity Analysis for Convex Separable Optimization Over Integral Polymatroids
Recommended article: Sensitivity theorems in integer linear programming
Recommended article: An effective linear approximation method for separable programming problems
Recommended article: On Proximity for k-Regular Mixed-Integer Linear Optimization
Recommended article: Successive approximation in separable programming: An improved procedure for convex separable programs
Recommended article: A two-segment approximation algorithm for separable convex programming with linear constraints
description: scientific article; zbMATH DE number 803752