On the relationship between the integer and continuous solutions of convex programs

DOI10.1016/S0167-6377(01)00082-7zbMath0981.90049WikidataQ57445529 ScholiaQ57445529MaRDI QIDQ5949923

No author found.

Publication date: 5 December 2001

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

convex program; nonlinear integer program; proximity analysis; quadratic program

Mathematics Subject Classification ID

90C25: Convex programming

90C10: Integer programming

90C30: Nonlinear programming

90C20: Quadratic programming

Related Items

A distributed computation algorithm for solving portfolio problems with integer variables

Cites Work

• Unnamed Item
• Some proximity and sensitivity results in quadratic integer programming
• An efficient branch and bound algorithm to solve the quadratic integer programming problem
• The relationship between integer and real solutions of constrained convex programming
• The value function of a mixed integer program. II
• Global optimization techniques for solving the general quadratic integer programming problem
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Sensitivity theorems in integer linear programming
• Convex separable optimization is not much harder than linear optimization