Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Schlöter, Miriam
21  Ergebnisse:
Personensuche X
?
1

Constructing lattice-free gradient polyhedra in dimension t..:

Paat, Joseph ; Schlöter, Miriam ; Speakman, Emily
Mathematical Programming.  192 (2021)  1-2 - p. 293-317 , 2021
Link: https://doi.org/10.1007/..
 
?
2

The integrality number of an integer program:

Paat, Joseph ; Schlöter, Miriam ; Weismantel, Robert
Mathematical Programming.  192 (2021)  1-2 - p. 271-291 , 2021
Link: https://doi.org/10.1007/..
 
?
3

Constructing Lattice-Free Gradient Polyhedra in Dimension T..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Paat, Joseph ; Schlöter, Miriam ; Speakman, Emily - p. 364-377 , 2020
Link: https://doi.org/10.1007/..
 
?
4

Tight Bounds for Online TSP on the Line:

Bjelde, Antje ; Hackfeld, Jan ; Disser, Yann...
ACM Transactions on Algorithms.  17 (2020)  1 - p. 1-58 , 2020
Link: https://doi.org/10.1145/..
 
?
5

The Integrality Number of an Integer Program:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Paat, Joseph ; Schlöter, Miriam ; Weismantel, Robert - p. 338-350 , 2020
Link: https://doi.org/10.1007/..
 
?
6

Tight Bounds for Online TSP on the Line:

Bjelde, Antje ; Hackfeld, Jan ; Disser, Yann...
ACM Transactions on Algorithms (TALG).  17 (2020)  1 - p. 1-58 , 2020
Link: https://dl.acm.org/doi/1..
 
?
7

Earliest Arrival Transshipments in Networks with Multiple S..:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,
Schlöter, Miriam - p. 370-384 , 2019
Link: https://doi.org/10.1007/..
 
?
8

Flows over time and submodular function minimization:

Schlöter, Miriam , 2018
Link: https://nbn-resolving.de..
 
?
9

Tight bounds for online TSP on the line:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Bjelde, Antje ; Disser, Yann ; Hackfeld, Jan... - p. 994-1005 , 2017
Link: https://dl.acm.org/doi/1..
 
?
10

Fast and memory-efficient algorithms for evacuation problem:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,
Schlöter, Miriam ; Skutella, Martin - p. 821-840 , 2017
Link: https://dl.acm.org/doi/1..
 
?
11

Minimum-Cost Flows Over Time:

Schlöter, Miriam ; Weismantel, Robert
http://arxiv.org/abs/2206.00526.  , 2022
Link: http://arxiv.org/abs/220..
 
?
12

Tight Bounds for Online TSP on the Line:

Bjelde, Antje ; Disser, Yann ; Hackfeld, Jan...
info:eu-repo/semantics/altIdentifier/doi/10.1145/3422362.  , 2021
Link: https://hal.inria.fr/hal..
 
?
13

A Faster Algorithm for Quickest Transshipments via an Exten..:

Schlöter, Miriam ; Skutella, Martin ; Van Tran, Khai
http://arxiv.org/abs/2108.06239.  , 2021
Link: http://arxiv.org/abs/210..
 
?
14

Constructing lattice-free gradient polyhedra in dimension t..:

Paat, Joseph ; Schlöter, Miriam ; Speakman, Emily
http://arxiv.org/abs/2002.11076.  , 2020
Link: http://arxiv.org/abs/200..
 
?
15

The Integrality Number of an Integer Program:

Paat, Joseph ; Schlöter, Miriam ; Weismantel, Robert
http://arxiv.org/abs/1904.06874.  , 2019
Link: http://arxiv.org/abs/190..
 
1-15