default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 58
Volume 58, Number 1, August 2011
- Oded Berman, Zvi Drezner, Dmitry Krass:
Big segment small segment global optimization algorithm on networks. 1-11 - Junho Chang, Soo Y. Chang, Sung-Pil Hong, Yun-Hong Min, Myoung-Ju Park
:
Approximation of a batch consolidation problem. 12-19 - Jean-Claude Bermond, Xavier Muñoz, Ignasi Sau:
Traffic grooming in bidirectional WDM ring networks. 20-35 - Bilal Khan, Kiran R. Bhutani:
Compression and expansion in graphs using overlays. 36-42 - Roberto Barrera, Daniela Ferrero:
Power domination in cylinders, tori, and generalized Petersen graphs. 43-49 - Roel Leus:
Resource allocation by means of project networks: Dominance results. 50-58 - Roel Leus:
Resource allocation by means of project networks: Complexity results. 59-67 - Daniel Reich, Leo Lopes:
The most likely path on series-parallel networks. 68-80
Volume 58, Number 2, September 2011
- Bernard Fortz, Luce Brotcorne:
Editorial: Preface to the Special Issue. 81-82 - Shoshana Anily, Michel Gendreau, Gilbert Laporte:
The preemptive swapping problem on a tree. 83-94 - Mustapha Aouchiche, Pierre Hansen:
Proximity and remoteness in graphs: Results and conjectures. 95-102 - Claudio Arbib, Martine Labbé, Mara Servilio:
Scheduling two chains of unit jobs on one machine: A polyhedral study. 103-113 - Teodor Gabriel Crainic, Xiaorui Fu, Michel Gendreau, Walter Rei, Stein W. Wallace:
Progressive hedging-based metaheuristics for stochastic network design. 114-124 - Corinne Feremans, Martine Labbé, Adam N. Letchford, Juan José Salazar González:
Generalized network design polyhedra. 125-136 - Patrick Jaillet, Xin Lu:
Online traveling salesman problems with service flexibility. 137-146 - Justo Puerto, Federica Ricca, Andrea Scozzari:
Minimax regret path location on trees. 147-158
Volume 58, Number 3, October 2011
- Christopher Groër, Blair D. Sullivan, Steve Poole:
A mathematical analysis of the R-MAT random graph generator. 159-170 - Abraham Duarte, Rafael Martí, Mauricio G. C. Resende, Ricardo M. A. Silva:
GRASP with path relinking heuristics for the antibandwidth problem. 171-189 - Behrooz Alizadeh, Rainer E. Burkard:
Combinatorial algorithms for inverse absolute and vertex 1-center location problems on trees. 190-200 - Camino Balbuena, Diego González-Moreno, Julián Salas:
Edge-superconnectivity of semiregular cages with odd girth. 201-206 - Jérémie Chalopin, Daniël Paulusma:
Graph labelings derived from models in distributed computing: A complete complexity classification. 207-231 - Peter D. Johnson Jr., Peter Slater, Matt Walsh:
The connected hub number and the connected domination number. 232-237
Volume 58, Number 4, December 2011
- Oli B. G. Madsen, Stefan Ropke:
ROUTE 2009: Recent advances in vehicle routing optimization. 239-240 - Claudia Archetti, Nicola Bianchessi, Maria Grazia Speranza:
A column generation approach for the split delivery vehicle routing problem. 241-254 - Enrique Benavent, Angel Corberán, Isaac Plana, José M. Sanchis:
New facets and an enhanced branch-and-cut for the min-max K-vehicles windy rural postman problem. 255-272 - Anders Dohn, Matias Sevel Rasmussen, Jesper Larsen:
The vehicle routing problem with time windows and temporal dependencies. 273-289 - Richard Lusby, Jesper Larsen:
Improved exact method for the double TSP with multiple stacks. 290-300 - Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk:
Cutting planes for branch-and-price algorithms. 301-310 - Min Wen, Emil Krapper, Jesper Larsen, Thomas K. Stidsen:
A multilevel variable neighborhood search heuristic for a practical vehicle routing and driver scheduling problem. 311-322
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-04-14 21:06 CEST 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:
