In this paper we propose two algorithms for solving both unweighted and weighted constrained two-dimensional two-staged cutting stock problems. The problem is called two-staged cutting problem because each produced (sub) optimal cutting pattern is realized by using two cut-phases.

This note provides a simple proof of the necessity of the transversality condition for the differentiable reduced-form model. The proof uses only an elementary perturbation argument without relying on dynamic programming. The proof makes it clear that, contrary to common belief, the necessity of...

This survey presents cutting planes that are useful or potentially useful in solving mixed integer programs. Valid inequalities for i) general integer programs, ii) problems with local structure such as knapsack constraints, and iii) problems with 0-1 coefficient matrices, such as set packing,...

A dual problem for convex generalized fractional programs with no duality gap is presented and it is shown how this dual program can be efficiently solved using a parametric approach. The resulting algorithm can be seen as "dual" to the Dinkelbach-type algorithm for generalized fractional...

Audit scheduling with overlapping activities and sequence dependent setup cost has not been treated in literature. This paper presents a formulation and a solution approach for this audit scheduling problem. In this paper, we treat the activity duration as a decision variable and include...