Browsing Faculty Publications (Bibliographic) by Author "Sierksma, G."
Now showing items 1-6 of 6
-
Branch and peg algorithms for the simple plant location problems
Goldengorin, B.; Ghosh, Diptesh; Sierksma, G. (2003-10-20)The simple plant location problem is a well-studied problem in combinatorial optimization. It is one of deciding where to locate a set of plants so that a set of clients can be supplied by them at the minimum cost. This ... -
Complete local search with memory
Ghosh, Diptesh; Sierksma, G. (2002-10-20) -
Networks in Action: Computer Exercises in Network Optimization
Sierksma, G.; Ghosh, Diptesh (Springer, 2011-01-12)Most books covering network optimization explain the theory but offer only exercises that support the understanding of that theory, and case studies that are offered are not suitable for classroom analysis, either because ... -
On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problem
Ghosh, Diptesh; Sierksma, G. (2003-10-22) -
Solving the simple plant location problem using a data correcting approach
Goldengorin, B.; Tijssen, G. A.; Ghosh, Diptesh; Sierksma, G. (2003-10-20)The Data Correcting Algorithm is a branch and bound type algorithm in which the data of a given problem instance is ‘corrected’ at each branching in such a way that the new instance will be as close as possible to a ... -
Tolerance-based branch and bound algorithms for the ATSP
Turkensteen, M.; Ghosh, Diptesh; Goldengorin, B.; Sierksma, G. (2008-11-09)The selection of entries to be included/excluded in Branch and Bound algorithms is usually done on the basis of cost values. We consider the class of Depth First Search algorithms, and we propose to use upper tolerances ...