A new procedure for solving integer linear programming problems

DOI10.1007/S13369-014-1079-6zbMath1390.90399OpenAlexW1987699462MaRDI QIDQ1639913

S. F. Tantawy

Publication date: 13 June 2018

Published in: Arabian Journal for Science and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13369-014-1079-6

zbMATH Keywords

integer linear programminglinear programconjugate gradient

Mathematics Subject Classification ID

Integer programming (90C10) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• The application of integer linear programming to the implementation of a graphical user interface: A new rectangular packing problem
• Outline of an algorithm for integer solutions to linear programs
• An Automatic Method of Solving Discrete Programming Problems
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints

This page was built for publication: A new procedure for solving integer linear programming problems