Ronald D. Armstrong, Prabhakant Sinha, Application of Quasi-Integer Programming to the Solution of Menu Planning Problems with Variable Portion Size, Management Science, Vol. 21, No. 4, Application ...

An extension of the algorithm to the general integer programming problem in bounded variables is briefly sketched in a concluding section. OR professionals in every field of study will find ...

The following is a simple mixed integer programming problem. Details can be found in Example 3.8 in the "Examples" section.

The feasibility pump is a well-established primal heuristic for mixed integer programming (MIP) that alternates between solving a linear programming (LP) relaxation of the original problem and ...

Integer linear programming can help find the answer to a variety of real-world problems. Now researchers have found a much faster way to do it.