default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 74
Volume 74, Number 1, July 2019
- Birol Yüceoglu
, Güvenç Sahin:
A branch-and-price algorithm for the rainbow cycle cover problems. 3-15 - Amr Elmasry, Ahmed Shokry:
A new algorithm for the shortest-path problem. 16-39 - Denis Aßmann, Frauke Liers, Michael Stingl:
Decomposable robust two-stage optimization: An application to gas network operations under uncertainty. 40-61 - Christopher Duffy, Gary MacGillivray:
The Firefighter problem: Saving sets of vertices on cubic graphs. 62-69 - Giorgio Ausiello, Paolo Giulio Franciosa, Isabella Lari, Andrea Ribichini:
Max flow vitality in general and st-planar graphs. 70-78 - Selin Damla Ahipasaoglu, Karthik Natarajan, Dongjian Shi:
Distributionally robust project crashing with partial or no correlation information. 79-106
Volume 74, Number 2, September 2019
Preface
- Raffaele Cerulli, Antonio Sforza, Daniele Vigo:
Preface: Special issue on network optimization in transportation, logistics, and industry. 109-110
- Daniela Ambrosino, Anna Sciomachen, Chiara Surace:
Evaluation of flow dependent external costs in freight logistics networks. 111-123 - Pasquale Avella, Giacomo Bernardi, Maurizio Boccia, Sara Mattia:
An optimization approach for congestion control in network routing with quality of service requirements. 124-133 - Francesco Carrabs, Carmine Cerrone, Rosa Pentangelo:
A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. 134-147 - Carmine Cerrone, Ciriaco D'Ambrosio, Andrea Raiconi:
Heuristics for the strong generalized minimum label spanning tree problem. 148-160 - Giorgio Gnecco, Yuval Hadas, Marcello Sanguineti:
Some properties of transportation network cooperative games. 161-173 - Adriano Masone, Claudio Sterle, Igor Vasilyev, Anton V. Ushakov:
A three-stage p-median based exact method for the optimal diversity management problem. 174-189 - Sara Mattia:
A polyhedral analysis of the capacitated edge activation problem with uncertain demands. 190-204
Volume 74, Number 3, October 2019
- Julian Hof, Michael Schneider:
An adaptive large neighborhood search with path relinking for a class of vehicle-routing problems with simultaneous pickup and delivery. 207-250 - Xueyu Shi, Bo Zeng, Oleg A. Prokopyev:
On bilevel minimum and bottleneck spanning tree problems. 251-273 - Yasemin Büyükçolak, Didem Gözüpek, Sibel Özkan:
Minimum reload cost cycle cover in complete graphs. 274-286 - Jérémy Omer, Michael Poss:
Time-dependent shortest paths with discounted waits. 287-301 - Iara Ciurria-Infosino, Daniel Granot, Frieda Granot:
Monotonicity and conformality in multicommodity network-flow problems. 302-319
Volume 74, Number 4, December 2019
Editorial
- Bruce L. Golden, Douglas R. Shier:
Editorial: 2018 Glover-Klingman Prize Winners. 323
- Bruce L. Golden, Douglas R. Shier:
Preface: Special Issue on Network Optimization in Transportation, Logistics, and Industry (Part 2). 324
- Halil I. Bayrak, Kamyar Kargar, Mustafa Ç. Pinar:
Bilateral trade with risk-averse intermediary using linear network optimization. 325-332 - Luigi De Giovanni, Nicola Gastaldon, Filippo Sottovia:
A two-level local search heuristic for pickup and delivery problems in express freight trucking. 333-350 - Massimo Di Francesco, Manlio Gaudioso, Enrico Gorgone, Paola Zuddas:
The forwarder planning problem in a two-echelon network. 351-359 - Daniel Duque, Andrés L. Medaglia:
An exact method for a class of robust shortest path problems with scenarios. 360-373 - Mauricio Granada, Eliana M. Toro, Ramón Gallego:
An MIP formulation for the open location-routing problem considering the topological characteristic of the solution-paths. 374-388
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-04 20:44 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:
