Ranking in quadratic integer programming problems

DOI10.1016/0377-2217(95)00245-6zbMath0953.90560OpenAlexW2058181580MaRDI QIDQ1278381

Lakshmisree Bandopadhyaya, Renu Gupta, Munish C. Puri

Publication date: 22 February 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00245-6

zbMATH Keywords

linear programminginteger programmingquadratic programmingranking the integer feasible solutions

Mathematics Subject Classification ID

Integer programming (90C10) Quadratic programming (90C20) Linear programming (90C05)

Related Items (4)

Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Optimization of a quadratic programming problem over an Integer efficient set ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The indefinite zero-one quadratic problem
• An algorithm for quadratic zero-one programs
• Roof duality, complementation and persistency in quadratic 0–1 optimization
• Methods of Nonlinear 0-1 Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Capital Expenditure Programming and Some Alternative Approaches to Risk
• Ranking in integer linear fractional programming problems

This page was built for publication: Ranking in quadratic integer programming problems