default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 69
Volume 69, Number 1, January 2017
Preface
- Luis Eduardo Neves Gouveia
, Michal Pióro, Jacek Rak:
Preface: Static and dynamic optimization models for network routing problems. 3-5
- Bernardetta Addis, Giuliana Carello, Sara Mattia:
Survivable green traffic engineering with shared protection. 6-22 - Marco Di Bartolomeo, Enrico Grande, Gaia Nicosia, Andrea Pacifici:
Cheapest paths in dynamic networks. 23-32 - Andreas Bley, Ivana Ljubic, Olaf Maurer:
A node-based ILP formulation for the node-weighted dominating Steiner problem. 33-51 - Olivier Brun, Balakrishna J. Prabhu, Josselin Vallet:
A penalized best-response algorithm for nonlinear single-path routing problems. 52-66 - Christina Büsing, Arie Koster, Sarah Kirchner, Annika Thome:
The budgeted minimum cost flow problem with unit upgrading cost. 67-82 - Lorenzo Castelli, Martine Labbé, Alessia Violin:
Network pricing problem with unit toll. 83-93 - Nadia Chaabane Fakhfakh, Cyril Briand, Marie-José Huguet, Alessandro Agnetis:
Finding a Nash equilibrium and an optimal sharing policy for multiagent network expansion game. 94-109 - Bernard Fortz, Enrico Gorgone, Dimitri Papadimitriou:
A Lagrangian heuristic algorithm for the time-dependent combined network design and routing problem. 110-123 - Fabio Furini, Virginie Gabrel, Ian-Christopher Ternier:
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem. 124-141 - Viet Hung Nguyen, Michel Minoux, Dang Phuong Nguyen:
Reduced-size formulations for metric and cut polyhedra in sparse graphs. 142-150 - Amaro de Sousa, Paulo P. Monteiro, Carlos B. Lopes:
Lightpath admission control and rerouting in dynamic flex-grid optical transport networks. 151-163
Volume 69, Number 2, March 2017
- Nicolas Catusse, Victor Chepoi, Karim Nouioua, Yann Vaxès:
Bidirected minimum Manhattan network problem. 167-178 - Masahide Saho, Maiko Shigeno:
Cancel-and-tighten algorithm for quickest flow problems. 179-188 - Maciej Rysz, Pavlo A. Krokhmal, Eduardo L. Pasiliao:
Detecting resilient structures in stochastic networks: A two-stage stochastic optimization approach. 189-204 - Alexandre Renaud, Nabil Absi, Dominique Feillet:
The stochastic close-enough arc routing problem. 205-221 - Xinyun Wu, Zhipeng Lü, Philippe Galinier:
Restricted swap-based neighborhood search for the minimum connected dominating set problem. 222-236
Volume 69, Number 3, May 2017
Preface
- Karl F. Doerner, Richard W. Eglese, Richard F. Hartl, Jakob Puchinger:
Preface: Special issue on the VeRoLog 2015 conference. 239-240
- Javier Belloso, Angel A. Juan, Enoc Martínez, Javier Faulin:
A biased-randomized metaheuristic for the vehicle routing problem with clustered and mixed backhauls. 241-255 - Burçin Bozkaya, F. Sibel Salman, Kaan Telciler:
An adaptive and diversified vehicle routing approach to reducing the security risk of cash-in-transit operations. 256-269 - Christian Kloimüllner, Günther R. Raidl:
Full-load route planning for balancing bike sharing systems by logic-based benders decomposition. 270-289 - Oliver Lum, Carmine Cerrone, Bruce L. Golden, Edward A. Wasil:
Partitioning a street network into compact, balanced, and visually appealing routes. 290-303 - Hanne Pollaris, Kris Braekers, An Caris, Gerrit K. Janssens, Sabine Limbourg:
Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints. 304-316 - Mesut Yavuz:
An iterated beam search algorithm for the green vehicle routing problem. 317-328 - Martin Josef Geiger:
On an effective approach for the coach trip with shuttle service problem of the VeRoLog solver challenge 2015. 329-345
Volume 69, Number 4, July 2017
- Benjamin Otto, Nils Boysen:
Zone-based tariff design in public transportation networks. 349-366 - Maria Afshari Rad, Hossein Taghizadeh Kakhki:
Two extended formulations for cardinality maximum flow network interdiction problem. 367-377 - Stephen R. Chestnut, Rico Zenklusen:
Hardness and approximation for network flow interdiction. 378-387 - Zhuqi Miao, Balabhaskar Balasundaram:
Approaches for finding cohesive subgroups in large-scale social networks via maximum k-plex detection. 388-407 - Thomas Lange, Manja Reinwardt, Peter Tittmann:
A recursive formula for the two-edge connected and biconnected reliability of a complete graph. 408-414
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-11-06 20:35 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:
