Browsing by Subject "0-1 Integer programming"

Now showing 1 - 3 of 3

Open Access
Computational analysis of the search based cuts on the multidimensional 0-1 knapsack problem
(2003) Pekbey, Duygu
In this thesis, the potential use of a recently proposed cut (the search based cut) for 0-1 programming problems by Oguz (2002) is analyzed. For this purpose, the search based cuts and a new algorithm based on the search based cuts are applied to multidimensional 0-1 knapsack problems from the literature as well as randomly generated multidimensional 0-1 knapsack problems. The results are compared with the implementation of CPLEX v8.1 in MIP mode and the results reported.
Open Access
Cutting plane algorithms for 0-1 programming based on cardinality cuts
(Elsevier, 2010) Oguz, O.
We present new valid inequalities for 0-1 programming problems that work in similar ways to well known cover inequalities. Discussion and analysis of these cuts is followed by their revision and use in integer programming as a new generation of cuts that excludes not only portions of polyhedra containing noninteger points, also parts with some integer points that have been explored in search of an optimal solution. Our computational experimentations demonstrate that this new approach has significant potential for solving large scale integer programming problems.
Open Access
An integer programming based algorithm for the resource constrained project scheduling problem
(2005) Büyüktahtakın, İsmet Esra
In this thesis, we study the problem of scheduling the activities of a single project in order for all resource and precedence relationships constraints to be satisfied with an objective of minimizing the project completion time. To solve this problem, we propose an Integer Programming based approximation algorithm, which has two phases. In the first phase of the algorithm, a subproblem generation technique and enumerative cuts used to tighten the formulation of the problem are presented. If an optimal solution is not found within a predetermined time limit, we continue with the second phase that uses the cuts and the lower bound obtained in the first phase. In order to evaluate the efficiency of our algorithm, we used the benchmark instances in the literature and compared the results with the best known solutions available for these instances. Finally, the computational results are reported and discussed.