default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 64
Volume 64, Number 1, August 2014
- Christina Graves, David Milan:
Reliability polynomials having arbitrarily many inflection points. 1-5 - Gang Feng:
Finding k shortest simple paths in directed graphs: A node classification algorithm. 6-17 - Marcus N. Brazil
, Charl J. Ras, Doreen A. Thomas:
A flow-dependent quadratic steiner tree problem in the Euclidean plane. 18-28 - Ulrich Derigs, Markus Pullmann:
Solving multitrip vehicle routing under order incompatibilities: A VRP arising in supply chain management. 29-39 - Steve Alpern, Robbert Fokkink:
Accumulation games on graphs. 40-47 - Foad Mahdavi Pajouh, Vladimir Boginski, Eduardo L. Pasiliao:
Minimum vertex blocker clique problem. 48-64
Volume 64, Number 2, September 2014
- Iara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, complements, and ripples in multicommodity flows on suspension graphs. 65-75 - Roswitha Rissner, Rainer E. Burkard:
Bounds on the radius and status of graphs. 76-83 - Patrick Jaillet, Xin Lu:
Online traveling salesman problems with rejection options. 84-95 - Florent Foucaud, Ralf Klasing, Peter J. Slater:
Centroidal bases in graphs. 96-108 - Kelly M. Sullivan, J. Cole Smith:
Exact algorithms for solving a Euclidean maximum flow network interdiction problem. 109-124 - Juan-Pablo Riquelme-Rodríguez, André Langevin, Michel Gamache:
Adaptive large neighborhood search for the periodic capacitated arc routing problem with inventory constraints. 125-139
Volume 64, Number 3, October 2014
- Christos D. Tarantilis, Roberto Baldacci:
Editorial. 141-142
- Andrea Trautsamwieser, Patrick Hirsch:
A Branch-Price-and-Cut approach for solving the medium-term home health care planning problem. 143-159 - Nicolas Jozefowiez:
A branch-and-price algorithm for the multivehicle covering tour problem. 160-168 - Marcela Monroy-Licht, Ciro-Alberto Amaya, André Langevin:
The Rural Postman Problem with time windows. 169-180 - Dorit S. Hochbaum, Cheng Lyu, Fernando Ordóñez:
Security routing games with multivehicle Chinese postman problem. 181-191 - Attila A. Kovacs, Bruce L. Golden, Richard F. Hartl, Sophie N. Parragh:
Vehicle routing problems in which consistency considerations are important: A survey. 192-213 - George Ninikas, Ioannis Minis:
Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls. 214-231
Volume 64, Number 4, December 2014
- Raffaele Cerulli, Monica Gentili:
Editorial. 233 - Gabriella Muratore:
More facets for survivable networks. 234-261 - Adamo Bosco, Demetrio Laganà, Roberto Musmanno, Francesca Vocaturo:
A matheuristic algorithm for the mixed capacitated general routing problem. 262-281 - Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi:
Vehicle routing problems with different service constraints: A branch-and-cut-and-price algorithm. 282-291 - Maurizio Bruglieri, Alberto Colorni, Alessandro Lué:
The relocation problem for the one-way electric vehicle sharing. 292-305 - Claudio Arbib, Giovanni Felici, Mara Servilio:
Sorting common operations to minimize the number of tardy jobs. 306-320 - Raffaele Cerulli, Monica Gentili, Andrea Raiconi:
Maximizing lifetime and handling reliability in wireless sensor networks. 321-338 - Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli:
A memetic algorithm for the weighted feedback vertex set problem. 339-356
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-12-19 22:13 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:
