Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 1 of 1 for “"Long step primal dual subproblem simplex method"”.
-
Combined objective least squares and long step primal dual subproblem simplex methods
… of this research work is an improvement to the primal dual subproblem simplex method for set partitioning/packing/covering problems with convexity constraints. Primal dual subproblem simplex methods are very successful in solving large-scale set partitioning problems. In each step of the primal …