Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 57
Volume 57, Number 1, January 2011
- Ravindra K. Ahuja, Christian Liebchen:
Special issue of Networks on optimization in scheduled transportation networks. 1-2 - Gabrio Caimi, Martin Fuchsberger, Marco Laumanns
, Kaspar Schüpbach:
Periodic railway timetabling with event flexibility. 3-18 - Thorsten Gunkel, Mathias Schnee, Matthias Müller-Hannemann:
How to find good night train connections. 19-27 - Natalia Kliewer, Leena Suhl:
A note on the online nature of the railway delay management problem. 28-37 - Reinhard Bauer, Daniel Delling, Dorothea Wagner:
Experimental study of speed up techniques for timetable information systems. 38-52 - Luigi Moccia, Jean-François Cordeau, Gilbert Laporte, Stefan Ropke, Maria Pia Valentini:
Modeling and solving a multimodal transportation problem with flexible-time and scheduled services. 53-68 - Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet, Serigne Gueye:
A MIP-based local search method for the railway rescheduling problem. 69-86 - Riko Jacob, Peter Márton, Jens Maue, Marc Nunkesser:
Multistage methods for freight train classification. 87-105 - Christina Büsing, Sebastian Stiller:
Line planning, path constrained network flow and inapproximability. 106-113
Volume 57, Number 2, March 2011
- Shenwei Huang, Erfang Shan:
A note on the upper bound for the paired-domination number of a graph with minimum degree at least two. 115-116 - Gwenaël Joret:
Stackelberg network pricing is hard to approximate. 117-120 - Gabriela Araujo-Pardo, Camino Balbuena:
Constructions of small regular bipartite graphs of girth 6. 121-127 - Wei Yu, Zhaohui Liu:
Single-vehicle scheduling problems with release and service times on a line. 128-134 - Thomas Kalinowski:
A minimum cost flow formulation for approximated MLC segmentation. 135-140 - Christian Raack, Arie M. C. A. Koster, Sebastian Orlowski, Roland Wessäly:
On cut-based inequalities for capacitated network design polyhedra. 141-156 - Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer:
Nonadaptive broadcasting in trees. 157-168 - Stefan Ruzika, Heike Sperber, Mechthild Steiner:
Earliest arrival flows on series-parallel graphs. 169-173 - Isidoro Gitler, Feliu Sagols:
On terminal delta-wye reducibility of planar graphs. 174-186 - Jessen T. Havill, Kevin R. Hutson:
Optimal online ring routing. 187-197
Volume 57, Number 3, May 2011
- Giovanni Righini:
Editorial: Preface to the Special Issue. 199 - Paolo Detti, Gaia Nicosia, Andrea Pacifici, Mara Servilio:
Optimal power control in OFDMA cellular networks. 200-211 - Cid C. de Souza, Victor F. Cavalcante:
Exact algorithms for the vertex separator problem in graphs. 212-230 - Valentina Cacchiani, Albert Einstein Fernandes Muritiba, Marcos Negreiros, Paolo Toth:
A multistart heuristic for the equality generalized traveling salesman problem. 231-239 - Jean François Maurras, Rüdiger Stephan:
On the cardinality constrained matroid polytope. 240-246 - Alessandro Aloisio, Claudio Arbib, Fabrizio Marinelli:
On LP relaxations for the pattern minimization problem. 247-253 - Edoardo Amaldi, Giulia Galbiati, Francesco Maffioli:
On minimum reload cost paths, tours, and flows. 254-260 - Raphael C. S. Machado, Celina M. H. de Figueiredo:
A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs. 261-269 - Niklaus Eggenberg, Matteo Salani, Michel Bierlaire:
Uncertainty feature optimization: An implicit paradigm for problems with noisy data. 270-284 - Evangelos Bampas, Aris Pagourtzis, Katerina Potika:
An experimental study of maximum profit wavelength assignment in WDM rings. 285-293 - Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating median paths on connected outerplanar graphs. 294-307
Volume 57, Number 4, July 2011
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2009 Glover-Klingman Prize winners. 309 - Lucia Draque Penso, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Connectivity and diameter in distance graphs. 310-315 - José Gómez, Josep Fàbrega, José Luis Andres Yebra:
On large (Δ, D, D, 1)-graphs. 316-327 - Martti Hamina, Matti Peltola:
Least central subtrees, center, and centroid of a tree. 328-332 - Wojciech Kabacinski, Tomasz Wichary:
Nonblocking multirate log2(N, m, p) switching networks with multicast connections. 333-343 - Peter Damaschke:
Finding hidden hubs and dominating sets in sparse graphs by randomized neighborhood queries. 344-350 - Matthias Kriesell:
Balancing two spanning trees. 351-353 - Doreen A. Thomas, Kevin Prendergast, Jia F. Weng:
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies 1 <= m <= sqrt(3). 354-361 - Minghe Sun:
Finding integer efficient solutions for multiple objective network programming problems. 362-375 - Rico Zenklusen, Marco Laumanns:
High-confidence estimation of small s-t reliabilities in directed acyclic networks. 376-388
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-06-29 00:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
