Search Results - person:"Woeginger, Gerhard"

The bipartite travelling salesman problem : a pyramidally solvable case

Deineko, Vladimir G.; Klinz, Bettina; Woeginger, Gerhard J. - In: Operations research letters : a journal of INFORMS … 55 (2024), pp. 1-7

Persistent link: https://www.econbiz.de/10015049763

In memoriam Gerhard Woeginger

Lenstra, Jan K.; Rendl, Franz; Spieksma, Frits C. R.; … - In: Journal of scheduling : JOS 25 (2022) 5, pp. 503-505

Persistent link: https://www.econbiz.de/10013453901

A note on the complexity of the bilevel bottleneck assignment problem

Fischer, Dennis; Muluk, Komal; Woeginger, Gerhard J. - In: 4OR : quarterly journal of the Belgian, French and … 20 (2022) 4, pp. 713-718

Persistent link: https://www.econbiz.de/10013445545

The trouble with the second quantifier

Woeginger, Gerhard J. - In: 4OR : quarterly journal of the Belgian, French and … 19 (2021) 2, pp. 157-181

Persistent link: https://www.econbiz.de/10012542446

Recognising permuted Demidenko matrices

Çela, Eranda; Deineko, Vladimir G.; Woeginger, Gerhard J. - In: Operations research letters 51 (2023) 5, pp. 494-500

Persistent link: https://www.econbiz.de/10014495875

Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations

Briskorn, Dirk; Woeginger, Gerhard J. - In: Operations research letters 51 (2023) 3, pp. 285-288

Persistent link: https://www.econbiz.de/10014374866

Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms

Sgall, Jiří; Woeginger, Gerhard J. - In: Operations research letters 51 (2023) 6, pp. 583-590

Persistent link: https://www.econbiz.de/10014465730

In memoriam Gerhard Woeginger

Lenstra, Jan K.; Rendl, Franz; Spieksma, Frits C. R.; … - In: Operations research letters 50 (2022) 3, pp. iii

Persistent link: https://www.econbiz.de/10013364076

Robust balanced optimization

Ficker, Annette M. C.; Spieksma, Frits C. R.; … - 2018

Persistent link: https://www.econbiz.de/10011799019

A note on the complexity of the bilevel bottleneck assignment problem

Fischer, Dennis; Muluk, Komal; Woeginger, Gerhard J. - In: 4OR 20 (2021) 4, pp. 713-718

We establish the NP-completeness of the variant of the bilevel assignment problem, where the leader and the follower both have bottleneck objective functions and were the follower behaves according to the optimistic rule. This result settles a problem that has been left open by Klinz & Gassner...

Persistent link: https://www.econbiz.de/10014497495

1
2
3
4
5
6
7
8
9
10
Next
Last