Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Isabel Beckenbach"'
Publikováno v:
EMS Newsletter. :49-52
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ddbe2b905125e477539231bedc8f62fc
https://doi.org/10.4171/news/117/11
https://doi.org/10.4171/news/117/11
Autor:
Konstantin Fackeldey, Isabel Beckenbach, Andreas Grever, Ambros M. Gleixner, Jakob Witzig, Leon Eifler, Marcus Weber
Publikováno v:
Multiscale Modeling & Simulation. 16:248-265
In this paper, we present a new, optimization-based method to exhibit cyclic behavior in nonreversible stochastic processes. While our method is general, it is strongly motivated by discrete simulations of ordinary differential equations representing
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86f0d2a4fb95a860521dd916aa59f626
https://doi.org/10.1137/16m1091162
https://doi.org/10.1137/16m1091162
Autor:
Robert Scheidweiler, Isabel Beckenbach
Publikováno v:
Discrete Mathematics. 340:2499-2506
We prove characterizations of the existence of perfect f-matchings in uniform mengerian and perfect hypergraphs. Moreover, we investigate the f-factor problem in balanced hypergraphs. For uniform balanced hypergraphs we prove two existence theorems w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::252bf84c90c01a9db97b123f50e37314
https://doi.org/10.1016/j.disc.2017.05.005
https://doi.org/10.1016/j.disc.2017.05.005
Autor:
Isabel Beckenbach
Publikováno v:
Operations Research Proceedings ISBN: 9783319899190
We describe a network simplex algorithm for the minimum cost flow problem on graph-based hypergraphs which are directed hypergraphs of a particular form occurring in railway rotation planning. The algorithm is based on work of Cambini, Gallo, and Scu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::322b028b7bf7595450690d8e69f0587d
https://doi.org/10.1007/978-3-319-89920-6_42
https://doi.org/10.1007/978-3-319-89920-6_42
Autor:
Ralf Borndörfer, Isabel Beckenbach
Publikováno v:
Operations Research Proceedings ISBN: 9783319286952
OR
BASE-Bielefeld Academic Search Engine
OR
BASE-Bielefeld Academic Search Engine
We investigate the matching and perfect matching polytopes of hypergraphs having a special structure, which we call partitioned hypergraphs. We show that the integrality gap of the standard LP-relaxation is at most \(2\sqrt{d}\) for partitioned hyper
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8653422d59eee895741879ca546d3f25
https://doi.org/10.1007/978-3-319-28697-6_5
https://doi.org/10.1007/978-3-319-28697-6_5
Publikováno v:
OR-News : das Magazin der GOR, 53, 10-14. Deutsche Gesellschaft für Operations Research
BASE-Bielefeld Academic Search Engine
BASE-Bielefeld Academic Search Engine
Traveling an entire subway or S-Bahn network as fast as possible has become a kind of sport in many major cities, with increasing popularity. The Guinness Book of Records already has several entries in this category, all quite recent. Of course, the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::5984444424a42c0458fc102de6e60142
https://research.utwente.nl/en/publications/the-sbahn-challenge-in-berlin(a3d27ef7-93ac-4674-8112-4301650bb879).html
https://research.utwente.nl/en/publications/the-sbahn-challenge-in-berlin(a3d27ef7-93ac-4674-8112-4301650bb879).html