Narrow search
Showing 1 - 10 of 50
Cover Image
Fast algorithms for the maximum convolution problem
Bussieck, Michael; Hassler, Hannes; Woeginger, Gerhard J.; … - In: Operations research letters 15 (1994) 3, pp. 133-142
Persistent link: https://www.econbiz.de/10006867729
Cover Image
On the nearest neighbor rule for the traveling salesman problem
Hurkens, Cor A.J.; Woeginger, Gerhard J. - In: Operations research letters 32 (2004) 1, pp. 1-4
Persistent link: https://www.econbiz.de/10006819255
Cover Image
The two-machine open shop problem: To fit or not to fit, that is the question
van den Akker, Marjan; Hoogeveen, Han; Woeginger, Gerhard J. - In: Operations research letters 31 (2003) 3, pp. 219-224
Persistent link: https://www.econbiz.de/10006823392
Cover Image
Local search for the minimum label spanning tree problem with bounded color classes
Brüggemann, Tobias; Monnot, Jérôme; Woeginger, Gerhard J. - In: Operations research letters 31 (2003) 3, pp. 195-201
Persistent link: https://www.econbiz.de/10006823395
Cover Image
On-line scheduling of unit time jobs with rejection: minimizing the total completion time
Epstein, Leah; Noga, John; Woeginger, Gerhard J. - In: Operations research letters 30 (2002) 6, pp. 415-420
Persistent link: https://www.econbiz.de/10006825500
Cover Image
Embeddings of planar graphs that minimize the number of long-face cycles
Woeginger, Gerhard J. - In: Operations research letters 30 (2002) 3, pp. 167-168
Persistent link: https://www.econbiz.de/10006826668
Cover Image
The quadratic 0-1 knapsack problem with series-parallel support
Rader Jr, David J.; Woeginger, Gerhard J. - In: Operations research letters 30 (2002) 3, pp. 159-166
Persistent link: https://www.econbiz.de/10006826669
Cover Image
An efficient algorithm for a class of constraint satisfaction problems
Woeginger, Gerhard J. - In: Operations research letters 30 (2002) 1, pp. 9-16
Persistent link: https://www.econbiz.de/10006827516
Cover Image
A very difficult scheduling problem with communication delays
Hoogeveen, Han; Woeginger, Gerhard J. - In: Operations research letters 29 (2001) 5, pp. 241-246
Persistent link: https://www.econbiz.de/10006829473
Cover Image
Hardness of approximation of the discrete time-cost tradeoff problem
Deineko, Vladimir G.; Woeginger, Gerhard J. - In: Operations research letters 29 (2001) 5, pp. 207-210
Persistent link: https://www.econbiz.de/10006829478