default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 65
Volume 65, Number 1, January 2015
- Jörg Kalcsics
, Stefan Nickel, Justo Puerto, Antonio M. Rodríguez-Chía:
Several 2-facility location problems on networks with equity objectives. 1-9 - Jesús Sánchez-Oro, Manuel Laguna, Abraham Duarte, Rafael Martí:
Scatter search for the profile minimization problem. 10-21 - Nikola Markovic, Ilya O. Ryzhov, Paul M. Schonfeld:
Evasive flow capture: Optimal location of weigh-in-motion systems, tollbooths, and security checkpoints. 22-42 - Thais Ávila, Angel Corberán, Isaac Plana, José María Sanchis:
The stacker crane problem and the directed general routing problem. 43-55 - Pierre-Olivier Bauguion, Walid Ben-Ameur, Éric Gourdin:
Efficient algorithms for the maximum concurrent flow problem. 56-67 - Yuanyuan Dong, Eli V. Olinick, T. Jason Kratz, David W. Matula:
A compact linear programming formulation of the maximum concurrent flow problem. 68-87 - Claudio Contardo, Guy Desaulniers, François Lessard:
Reaching the elementary lower bound in the vehicle routing problem with time windows. 88-99
Volume 65, Number 2, March 2015
Editorial
- Maria Battarra, Richard W. Eglese, Günes Erdogan:
Guest editorial: Recent trends in vehicle routing. 101
- Thibaut Vidal, Teodor Gabriel Crainic, Michel Gendreau, Christian Prins:
Timing problems and algorithms: Time decisions for sequences of activities. 102-128 - Pasquale Avella, Maurizio Boccia, Laurence A. Wolsey:
Single-item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances. 129-138 - Daniele Manerba, Renata Mansini:
A branch-and-cut algorithm for the multi-vehicle traveling purchaser problem with pairwise incompatibility constraints. 139-154 - Ana Maria Rodrigues, José Soeiro Ferreira:
Waste collection routing - limited multiple landfills and heterogeneous fleet. 155-165 - Tolga Bektas, Jens Lysgaard:
Optimal vehicle routing with lower and upper bounds on route durations. 166-179 - Michael Bögl, Karl F. Doerner, Sophie N. Parragh:
The school bus routing and scheduling problem with transfers. 180-203
Volume 65, Number 3, May 2015
- Bang Ye Wu, Hung-Lung Wang:
The next-to-shortest path problem on directed graphs with positive edge weights. 205-211 - Andrea D'Ariano, Dario Pacciarelli, Marco Pistelli, Marco Pranzo:
Real-time scheduling of aircraft arrivals and departures in a terminal maneuvering area. 212-227 - Marie Schmidt, Anita Schöbel:
The complexity of integrating passenger routing decisions in public transportation models. 228-243 - Ekkehard Köhler, Martin Strehler:
Traffic signal optimization using cyclically expanded networks. 244-261 - Tobias Harks, Ingo Kleinert, Max Klimm, Rolf H. Möhring:
Computing network tolls with support constraints. 262-285
Volume 65, Number 4, July 2015
Research Articles
- Pablo Adasme, Rafael Andrade, Marc Letournel, Abdel Lisser:
Stochastic maximum weight forest problem. 289-305 - Ashwin Arulselvan, Olaf Maurer, Martin Skutella:
An incremental algorithm for the uncapacitated facility location problem. 306-311 - Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat:
Network spot-checking games: Theory and application to toll enforcing in transportation networks. 312-328 - Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena, Bernard Gendron:
Formulations and exact solution approaches for the degree preserving spanning tree problem. 329-343 - Frédéric Giroire, Stéphane Pérennes, Issam Tahiri:
On the complexity of equal shortest path routing. 344-352 - Enrico Malaguti, Isabel Méndez-Díaz, Juan José Miranda Bront, Paula Zabala:
A branch-and-price algorithm for the (k, c)-coloring problem. 353-366 - Dilson Lucas Pereira, Michel Gendreau, Alexandre Salles da Cunha:
Branch-and-cut and Branch-and-cut-and-price algorithms for the adjacent only quadratic minimum spanning tree problem. 367-379 - S. Raghavan, Mustafa Sahin:
Efficient Edge-swapping heuristics for the reload cost spanning tree problem. 380-394
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:
