Zobrazeno 1 - 10
of 115
pro vyhledávání: '"F. Bruce Shepherd"'
Publikováno v:
Operations Research Letters. 51:72-78
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::17084e108fec0c20eff373c510347862
https://doi.org/10.1016/j.orl.2022.12.001
https://doi.org/10.1016/j.orl.2022.12.001
Autor:
Joseph Poremba, F. Bruce Shepherd
Publikováno v:
Integer Programming and Combinatorial Optimization ISBN: 9783031327254
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::019ee9cd8eafd0faf859c4739257987d
https://doi.org/10.1007/978-3-031-32726-1_29
https://doi.org/10.1007/978-3-031-32726-1_29
Publikováno v:
Integer Programming and Combinatorial Optimization
Integer Programming and Combinatorial Optimization, 12707, Springer International Publishing, pp.326-339, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-73879-2_23⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
Integer Programming and Combinatorial Optimization, 12707, Springer International Publishing, pp.326-339, 2021, Lecture Notes in Computer Science, ⟨10.1007/978-3-030-73879-2_23⟩
Integer Programming and Combinatorial Optimization ISBN: 9783030738785
IPCO
Since 1997 there has been a steady stream of advances for the maximum disjoint paths problem. Achieving tractable results has usually required focusing on relaxations such as: (i) to allow some bounded edge congestion in solutions, (ii) to only consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::606fbee66ad10792d4de1f6ca8648cbe
https://hal.archives-ouvertes.fr/hal-03514641/file/USRA_2020.pdf
https://hal.archives-ouvertes.fr/hal-03514641/file/USRA_2020.pdf
Publikováno v:
Mathematical Programming
Mathematical Programming, 2022, ⟨10.1007/s10107-022-01780-0⟩
Mathematical Programming, 2022, ⟨10.1007/s10107-022-01780-0⟩
Since 1997 there has been a steady stream of advances for the maximum disjoint paths problem. Achieving tractable results has usually required focusing on relaxations such as: (i) to allow some bounded edge congestion in solutions, (ii) to only consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::af901f5e524ac9648a2818c150addd1e
http://arxiv.org/abs/2007.10537
http://arxiv.org/abs/2007.10537
Autor:
F. Bruce Shepherd, Adrian Vetta
Publikováno v:
Theory of Computing. 13:1-25
We consider the single-sink network flow problem. An instance consists of a capacitated graph (directed or undirected), a sink node t and a set of demands that we want to send to the sink. Here demand i is located at a node si and requests an amount
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f606bbe11ce3b57a21b3a69b487d35b4
https://doi.org/10.4086/toc.2017.v013a020
https://doi.org/10.4086/toc.2017.v013a020
Autor:
Neil Olver, F. Bruce Shepherd
Publikováno v:
Mathematics of Operations Research, 39(2), 561-572. INFORMS Inst.for Operations Res.and the Management Sciences
Olver, N K & Shepherd, F B 2014, ' Approximability of Robust Network Design ', Mathematics of Operations Research, vol. 39, no. 2, pp. 561-572 . https://doi.org/10.1287/moor.2013.0620
Mathematics of Operations Research, 39(2), 561-572
Olver, N K & Shepherd, F B 2014, ' Approximability of Robust Network Design ', Mathematics of Operations Research, vol. 39, no. 2, pp. 561-572 . https://doi.org/10.1287/moor.2013.0620
Mathematics of Operations Research, 39(2), 561-572
We consider robust (undirected) network design (RND) problems where the set of feasible demands may be given by an arbitrary convex body. This model, introduced by Ben-Ameur and Kerivin [Ben-Ameur W, Kerivin H (2003) New economical virtual private ne
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::51283e905054ae54930855aec5d61739
https://doi.org/10.1287/moor.2013.0620
https://doi.org/10.1287/moor.2013.0620
Publikováno v:
ESA
Goyal, N, Olver, N K & Shepherd, F B 2011, ' Dynamic vs Oblivious Routing in Network Design ', Algorithmica, vol. 61, no. 1, pp. 161-173 . https://doi.org/10.1007/s00453-010-9455-4
Algorithmica, 61(1), 161-173. Springer New York
Goyal, N, Olver, N K & Shepherd, F B 2011, ' Dynamic vs Oblivious Routing in Network Design ', Algorithmica, vol. 61, no. 1, pp. 161-173 . https://doi.org/10.1007/s00453-010-9455-4
Algorithmica, 61(1), 161-173. Springer New York
Consider the robust network design problem of finding a minimum cost network with enough capacity to route all traffic demand matrices in a given polytope. We investigate the impact of different routing models in this robust setting: in particular, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4db1c33041e016ab668a4d7cd97b8f8
https://doi.org/10.1007/s00453-010-9455-4
https://doi.org/10.1007/s00453-010-9455-4
Publikováno v:
STOC
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, ..., sktk, the goal is to maximize the number of pairs that can be connected (routed) by edge-disjoint paths. The natural multico
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1c3c401d295afde277b943b4ddea75c0
https://doi.org/10.1137/060674442
https://doi.org/10.1137/060674442
Autor:
Chandra Chekuri, F. Bruce Shepherd
Publikováno v:
SIAM Journal on Discrete Mathematics. 23:163-177
A well-known theorem of Nash-Williams and Tutte gives a necessary and sufficient condition for the existence of $k$ edge-disjoint spanning trees in an undirected graph. A corollary of this theorem is that every $2k$-edge-connected graph has $k$ edge-
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ef209d3840beefe8a4f65c6011a58fb9
https://doi.org/10.1137/040617339
https://doi.org/10.1137/040617339
Publikováno v:
Algorithmica. 54:400-412
We consider multicommodity flow problems in capacitated graphs where the treewidth of the underlying graph is bounded by r. The parameter r is allowed to be a function of the input size. An instance of the problem consists of a capacitated graph and
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7733fe48f600b2a4a63558e4e80f1d6c
https://doi.org/10.1007/s00453-007-9129-z
https://doi.org/10.1007/s00453-007-9129-z