Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Golden, Bruce L."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minisum multipurpose trip location problem on trees
Mojtaba Araghi
,
Oded Berman
,
Igor Averbakh
Networks
63
(2), 2014, pp. 154-159
The split delivery capacitated team orienteering problem
C. Archetti
,
N. Bianchessi
,
M.G. Speranza
,
A. Hertz
Networks
63
(1), 2014, pp. 16-33
Incomplete service and split deliveries in a routing problem with profits
Claudia Archetti
,
Nicola Bianchessi
,
M. Grazia Speranza
,
Alain Hertz
Networks
63
(2), 2014, pp. 135-145
Cooperative covering problems on networks
Igor Averbakh
,
Oded Berman
,
Dmitry Krass
,
Jörg Kalcsics
,
Stefan Nickel
Networks
63
(4), 2014, pp. 334-349
A branch-price-and-cut algorithm for the min-max
k
-vehicle windy rural postman problem
Enrique Benavent
,
Ángel Corberán
,
Guy Desaulniers
,
François Lessard
,
Isaac Plana
,
José M. Sanchis
Networks
63
(1), 2014, pp. 34-45
Complexity and approximability of the
k
-way vertex cut
André Berger
,
Alexander Grigoriev
,
Ruben van der Zwaan
Networks
63
(2), 2014, pp. 170-178
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results
Natashia Boland
,
Reena Kapoor
,
Simranjit Kaur
,
Thomas Kalinowski
Networks
63
(2), 2014, pp. 196-202
Vector connectivity in graphs
Endre Boros
,
Pinar Heggernes
,
Pim van 't Hof
,
Martin Milanic̑
Networks
63
(4), 2014, pp. 277-285
Nonexistence of optimal graphs for all terminal reliability
J.I. Brown
,
D. Cox
Networks
63
(2), 2014, pp. 146-153
Forty years of periodic vehicle routing
Ann Melissa Campbell
,
Jill Hardin Wilson
Networks
63
(1), 2014, pp. 2-15
Erratum to ``Forty years of periodic vehicle routing''
Ann Melissa Campbell
,
Jill Hardin Wilson
Networks
63
(3), 2014, pp. 276-276
Fully dynamic update of arc-flags
Gianlorenzo D'Angelo
,
Mattia D'Emidio
,
Daniele Frigioni
Networks
63
(3), 2014, pp. 243-259
Branch-and-cut algorithms for the vehicle routing problem with trailers and transshipments
Michael Drexl
Networks
63
(1), 2014, pp. 119-133
A new consistent vehicle routing problem for the transportation of people with disabilities
Dominique Feillet
,
Thierry Garaix
,
Fabien Lehuédé
,
Olivier Péton
,
Dominique Quadri
Networks
63
(3), 2014, pp. 211-224
A comparison of several models for the Hamiltonian
p
-median problem
Stefan Gollowitzer
,
Luis Gouveia
,
Gilbert Laporte
,
Dilson Lucas Pereira
,
Adam Wojciechowski
Networks
63
(4), 2014, pp. 350-363
Proximity graphs inside large weighted graphs
Bernardo M. Ábrego
,
Ruy Fabila-Monroy
,
Silvia Fernández-Merchant
,
David Flores-Peñaloza
,
Ferran Hurtado
,
Henk Meijer
,
Vera Sacristán
,
Maria Saumell
Networks
61
(1), 2013, pp. 29-39
A maritime inventory routing problem: Discrete time formulations and valid inequalities
Agostinho Agra
,
Henrik Andersson
,
Marielle Christiansen
,
Laurence Wolsey
Networks
62
(4), 2013, pp. 297-314
Shortest paths avoiding forbidden subpaths
Mustaq Ahmed
,
Anna Lubiw
Networks
61
(4), 2013, pp. 322-334
Routing and scheduling for energy and delay minimization in the powerdown model
Matthew Andrews
,
Antonio Fernández Anta
,
Lisa Zhang
,
Wenbo Zhao
Networks
61
(3), 2013, pp. 226-237
Robust capacity assignment solutions for telecommunications networks with uncertain demands
F. Babonneau
,
J.-P. Vial
,
O. Klopfenstein
,
A. Ouorou
Networks
62
(4), 2013, pp. 255-272
On the super-restricted arc-connectivity of
s
-geodetic digraphs
Camino Balbuena
,
Pedro García-Vázquez
,
Adriana Hansberg
,
Luis Pedro Montejano
Networks
61
(1), 2013, pp. 20-28
Search games on networks with travelling and search costs and with arbitrary searcher starting points
Vic Baston
,
Kensaku Kikuta
Networks
62
(1), 2013, pp. 72-79
Minimum-weight subgraphs with unicyclic components and a lower-bounded girth
Walid Ben-Ameur
,
Makhlouf Hadji
,
Adam Ouorou
Networks
61
(4), 2013, pp. 335-355
The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming
Maurizio Boccia
,
Carlo Mannino
,
Igor Vasilyev
Networks
62
(4), 2013, pp. 315-326
Decomposition algorithms for solving the minimum weight maximal matching problem
Merve Bodur
,
Tinaz Ekim
,
Z. Caner Taşkin
Networks
62
(4), 2013, pp. 273-287
Seiten 1
2
3
4
5
6
7
8
9
10
11
12
>