default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 67
Volume 67, Number 1, January 2016
- Harilaos N. Psaraftis
, Min Wen, Christos A. Kontovas:
Dynamic vehicle routing problems: Three decades and counting. 3-31 - Snezana Mladenovic, Slavko Veskovic, Irina Branovic, Sladjana Jankovic, Slavisa Acimovic:
Heuristic Based Real-Time Train Rescheduling System. 32-48 - Muad Abu-Ata, Feodor F. Dragan:
Metric tree-like structures in real-world networks: an empirical study. 49-68 - Isabella Lari, Federica Ricca, Justo Puerto, Andrea Scozzari:
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria. 69-81 - Pablo Moisset de Espanés, Ivan Rapaport, Daniel Remenik, Javiera Urrutia:
Robust reconstruction of Barabási-Albert networks in the broadcast congested clique model. 82-91
Volume 67, Number 2, March 2016
- Enrico Bartolini, Lawrence Bodin, Aristide Mingozzi:
The traveling salesman problem with pickup, delivery, and ride-time constraints. 95-110 - Hugh R. Medal:
The wireless network jamming problem subject to protocol interference. 111-125 - Jørgen Thorlund Haahr, Richard Martin Lusby:
A matheuristic approach to integrate humping and pullout sequencing operations at railroad hump yards. 126-138 - Revital Hollander Shabtai, Yehuda Roditty:
Line-broadcasting in complete k-ary trees. 139-147 - I. Diarrassouba, Virginie Gabrel, Ali Ridha Mahjoub, Luis Eduardo Neves Gouveia, Pierre Pesneau:
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem. 148-169 - Tomomi Matsui, Rudolf Scheifele:
A linear time algorithm for the unbalanced Hitchcock transportation problem. 170-182
Volume 67, Number 3, May 2016
Preface
- Gary A. Kochenberger, Fred W. Glover:
Preface. 185-186
- Annelies De Corte, Kenneth Sörensen:
An iterated local search algorithm for water distribution network design optimization. 187-198 - Francis J. Vasko, Eric Landquist, Gregory Kresge, Adam Tal, Yifeng Jiang, Xenophon Papademetris:
A simple and efficient strategy for solving very large-scale generalized cable-trench problems. 199-208 - Roberto Aringhieri, Andrea Grosso, Pierre Hosteins, Rosario Scatamacchia:
Local search metaheuristics for the critical node problem. 209-221 - Alessandro Hill, Stefan Voß:
An equi-model matheuristic for the multi-depot ring star problem. 222-237 - Sera Kahruman-Anderoglu, Austin Buchanan, Sergiy Butenko, Oleg A. Prokopyev:
On provably best construction heuristics for hard combinatorial optimization problems. 238-245 - Jean Respen, Nicolas Zufferey, Edoardo Amaldi:
Metaheuristics for a job scheduling problem with smoothing costs relevant for the car industry. 246-261
Volume 67, Number 4, July 2016
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2015 Glover-Klingman Prize Winners. 265
- Jason I. Brown, Danielle Cox:
Inflection points of reliability polynomials are dense in [0, 1]. 266-269 - Stephen D. Boyles, Tarun Rambha:
A note on detecting unbounded instances of the online shortest path problem. 270-276 - Benoit Vignac, François Vanderbeck, Brigitte Jaumard:
Reformulation and decomposition approaches for traffic routing in optical networks. 277-298 - Alper Atamtürk, Andrés Gómez, Simge Küçükyavuz:
Three-partition flow cover inequalities for constant capacity fixed-charge network flow problems. 299-315 - Ibrahima Diarrassouba, Hakan Kutucu, Ali Ridha Mahjoub:
Two node-disjoint hop-constrained survivable network design and polyhedra. 316-337 - Rex K. Kincaid, Sarah J. Kunkler, Michael Drew Lamar, David Phillips:
Algorithms and complexity results for finding graphs with extremal Randić index. 338-347
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 2025-11-26 07:55 CET 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:
