Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Woeginger, Gerhard J.
842  Ergebnisse:
Personensuche X
?
1

A linear time algorithm for linearizing quadratic and highe..:

Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan..
Mathematical Programming.  , 2024
Link: https://doi.org/10.1007/..
 
?
2

Travelling salesman paths on Demidenko matrices:

Çela, Eranda ; Deineko, Vladimir G. ; Woeginger, Gerhard J.
Discrete Applied Mathematics.  354 (2024)  - p. 3-14 , 2024
Link: https://doi.org/10.1016/..
 
?
3

The bipartite travelling salesman problem: A pyramidally so..:

Deineko, Vladimir G. ; Klinz, Bettina ; Woeginger, Gerhard J.
Operations Research Letters.  55 (2024)  - p. 107130 , 2024
Link: https://doi.org/10.1016/..
 
?
4

Hardness of flow time minimization in a crossdock with a si..:

Briskorn, Dirk ; Woeginger, Gerhard J.
Operations Research Letters.  51 (2023)  3 - p. 285-288 , 2023
Link: https://doi.org/10.1016/..
 
?
5

Multiprocessor jobs, preemptive schedules, and one-competit..:

Sgall, Jiří ; Woeginger, Gerhard J.
Operations Research Letters.  51 (2023)  6 - p. 583-590 , 2023
Link: https://doi.org/10.1016/..
 
?
6

Recognising permuted Demidenko matrices:

Çela, Eranda ; Deineko, Vladimir ; Woeginger, Gerhard J.
Operations Research Letters.  51 (2023)  5 - p. 494-500 , 2023
Link: https://doi.org/10.1016/..
 
?
7

A Linear Time Algorithm for Linearizing Quadratic and Highe..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan.. - p. 466-479 , 2023
Link: https://doi.org/10.1007/..
 
?
8

Non-Preemptive Tree Packing:

Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse
Algorithmica.  85 (2022)  3 - p. 783-804 , 2022
Link: https://doi.org/10.1007/..
 
?
9

Selfishness in strategic resource allocation problems:

Ravindran Vijayalakshmi, Vipin , 2021
Link: https://nbn-resolving.de..
 
?
10

Continuous facility location on graphs:

Hartmann, Tim A. ; Lendl, Stefan ; Woeginger, Gerhard J.
Mathematical Programming.  192 (2021)  1-2 - p. 207-227 , 2021
Link: https://doi.org/10.1007/..
 
?
11

Non-preemptive Tree Packing:

, In: Lecture Notes in Computer Science; Combinatorial Algorithms,
Lendl, Stefan ; Woeginger, Gerhard ; Wulf, Lasse - p. 456-468 , 2021
Link: https://doi.org/10.1007/..
 
?
12

A note on the complexity of the bilevel bottleneck assignme..:

Fischer, Dennis ; Muluk, Komal ; Woeginger, Gerhard J.
4OR.  20 (2021)  4 - p. 713-718 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Linearizable Special Cases of the Quadratic Shortest Path P..:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,
Çela, Eranda ; Klinz, Bettina ; Lendl, Stefan... - p. 245-256 , 2021
Link: https://doi.org/10.1007/..
 
?
14

A linear time algorithm for the robust recoverable selectio..:

Lachmann, Thomas ; Lendl, Stefan ; Woeginger, Gerhard J.
Discrete Applied Mathematics.  303 (2021)  - p. 94-107 , 2021
Link: https://doi.org/10.1016/..
 
?
15

The trouble with the second quantifier:

Woeginger, Gerhard J.
4OR.  19 (2021)  2 - p. 157-181 , 2021
Link: https://doi.org/10.1007/..
 
1-15