Browsing by Author Sierksma, G.

Jump to: 0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
or enter first few letters:  
Showing results 1 to 6 of 6
Issue DateTitleAuthor(s)
20-Oct-2003Branch and peg algorithms for the simple plant location problemsGoldengorin, B.; Ghosh, Diptesh; Sierksma, G.
20-Oct-2002Complete local search with memoryGhosh, Diptesh; Sierksma, G.
12-Jan-2011Networks in Action: Computer Exercises in Network OptimizationSierksma, G.; Ghosh, Diptesh
22-Oct-2003On the complexity of determining tolerances for epsilon-optimal solutions to min-max combinatorial optimization problemGhosh, Diptesh; Sierksma, G.
20-Oct-2003Solving the simple plant location problem using a data correcting approachGoldengorin, B.; Tijssen, G. A.; Ghosh, Diptesh; Sierksma, G.
9-Nov-2008Tolerance-based branch and bound algorithms for the ATSPTurkensteen, M.; Ghosh, Diptesh; Goldengorin, B.; Sierksma, G.