Zobrazeno 1 - 10
of 155
pro vyhledávání: '"KÖNEMANN, JOCHEN"'
Modern parcel logistic networks are designed to ship demand between given origin, destination pairs of nodes in an underlying directed network. Efficiency dictates that volume needs to be consolidated at intermediate nodes in typical hub-and-spoke fa
Externí odkaz:
http://arxiv.org/abs/2311.05094
Autor:
Van Dyk, Madison, Koenemann, Jochen
While many time-dependent network design problems can be formulated as time-indexed formulations with strong relaxations, the size of these formulations depends on the discretization of the time horizon and can become prohibitively large. The recentl
Externí odkaz:
http://arxiv.org/abs/2305.19176
Autor:
Van Dyk, Madison, Koenemann, Jochen
The recently developed dynamic discretization discovery (DDD) is a powerful method that allows many time-dependent problems to become more tractable. While DDD has been applied to a variety of problems, one particular challenge has been to deal with
Externí odkaz:
http://arxiv.org/abs/2303.01419
Autor:
Van Dyk, Madison, Koenemann, Jochen
Publikováno v:
In Computers and Operations Research September 2024 169
A classical branch of graph algorithms is graph transversals, where one seeks a minimum-weight subset of nodes in a node-weighted graph $G$ which intersects all copies of subgraphs~$F$ from a fixed family $\mathcal F$. Many such graph transversal pro
Externí odkaz:
http://arxiv.org/abs/2107.04763
Publikováno v:
In Theoretical Computer Science 1 June 2024 998
We explore the complexity of nucleolus computation in b-matching games on bipartite graphs. We show that computing the nucleolus of a simple b-matching game is NP-hard even on bipartite graphs of maximum degree 7. We complement this with partial posi
Externí odkaz:
http://arxiv.org/abs/2105.07161
Autor:
Koenemann, Jochen, Toth, Justin
This paper defines a general class of cooperative games for which the nucleolus is efficiently computable. This class includes new members for which the complexity of computing their nucleolus was not previously known. We show that when the minimum e
Externí odkaz:
http://arxiv.org/abs/2005.10853
Finding a stable matching is one of the central problems in algorithmic game theory. If participants are allowed to have ties and incomplete preferences, computing a stable matching of maximum cardinality is known to be NP-hard. In this paper we pres
Externí odkaz:
http://arxiv.org/abs/2005.05228
Autor:
Drake, James, Drygala, Marina, Fukasawa, Ricardo, Koenemann, Jochen, Linhares, Andre, Looi, Thomas, Phillips, John, Qian, David, Saber, Nikoo, Toth, Justin, Woodbeck, Chris, Yeung, Jessie
Craniosynostosis, a condition affecting 1 in 2000 infants, is caused by premature fusing of cranial vault sutures, and manifests itself in abnormal skull growth patterns. Left untreated, the condition may lead to severe developmental impairment. Stan
Externí odkaz:
http://arxiv.org/abs/1912.10601