default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 76
Volume 76, Number 1, July 2020
- Oscar Dowson
:
The policy graph decomposition of multistage stochastic programming problems. 3-23 - Gonzalo Lera-Romero, Juan José Miranda Bront, Francisco J. Soulignac:
Linear edge costs and labeling algorithms: The case of the time-dependent vehicle routing problem with time windows. 24-53 - Ghafour Ahani, Pawel Wiatr, Di Yuan:
Routing and scheduling of network flows with deadlines and discrete capacity allocation. 54-74 - Jason I. Brown, Corey D. C. DeGagné:
Rational roots of all-terminal reliability. 75-83 - Dilek Günneç, S. Raghavan, Rui Zhang:
A branch-and-cut approach for the least cost influence problem on social networks. 84-105 - Eric Chang, Chung-Kuan Cheng, Anushka Gupta, Po-Ya Hsu, Amanda Moffitt, Alissa Ren, Irene Tsaur, Samuel Wang:
Empirical study on sufficient numbers of minimum cuts in strongly connected directed random graphs. 106-121
- Appreciation to Referees. 122
Volume 76, Number 2, September 2020
Preface
- Ana Dolores López-Sánchez, Jesús Sánchez-Oro, Daniele Vigo:
Preface to the special issue on optimization in vehicle routing and logistics. 125-127
- Nicolás Cabrera, Andrés L. Medaglia, Leonardo Lozano, Daniel Duque:
An exact bidirectional pulse algorithm for the constrained shortest path. 128-146 - Chefi Triki, Sujan Piya, Liang-Liang Fu:
Integrating production scheduling and transportation procurement through combinatorial auctions. 147-163 - Daniel Schermer, Mahdi Moeini, Oliver Wendt:
A branch-and-cut approach and alternative formulations for the traveling salesman problem with drone. 164-186 - Maximilian Löffler, Guy Desaulniers, Stefan Irnich, Michael Schneider:
Routing electric vehicles with a single recharge per route. 187-205 - Zhiyuan Lin, Raymond S. K. Kwan:
Avoiding unnecessary demerging and remerging of multi-commodity integer flows. 206-231 - Afonso H. Sampaio, Martin W. P. Savelsbergh, Lucas P. Veelenturf, Tom Van Woensel:
Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers. 232-255 - Benjamin Graf:
Adaptive large variable neighborhood search for a multiperiod vehicle and technician routing problem. 256-272 - Caroline J. Jagtenberg, Oliver J. Maclaren, Andrew J. Mason, Andrea Raith, Kevin Shen, Michael Sundvick:
Columnwise neighborhood search: A novel set partitioning matheuristic and its application to the VeRoLog Solver Challenge 2019. 273-293 - Ahmed Kheiri, Leena N. Ahmed, Burak Boyaci, Joaquim A. S. Gromicho, Christine L. Mumford, Ender Özcan, Ali Selim Dirikoç:
Exact and hyper-heuristic solutions for the distribution-installation problem from the VeRoLog 2019 challenge. 294-319
Volume 76, Number 3, October 2020
- Zacharie Alès, Arnaud Knippel:
The K-partitioning problem: Formulations and branch-and-cut. 323-349 - Nathan Albin, Kapila Kottegoda, Pietro Poggi-Corradini:
Spanning tree modulus for secure broadcast games. 350-365 - Logan A. Smith, Derek Mikesell, Illya V. Hicks:
An integer program for positive semidefinite zero forcing in graphs. 366-380 - Pierre Hosteins, Rosario Scatamacchia:
The stochastic critical node problem over trees. 381-401 - Sara Bourbour, Dinesh P. Mehta, William C. Navidi:
Improved methods to compare distance metrics in networks using uniform random spanning trees (DIMECOST). 402-413 - Isaac Brown, Christina Graves, Brendan Miller, Tyler Russell:
Most reliable two-terminal graphs with node failures. 414-426
Volume 76, Number 4, December 2020
Preface
- Ángel Corberán, Demetrio Laganà, Francesca Vocaturo:
Preface: Special issue on arc routing problems and other related topics. 429-430
- Georg E. A. Froehlich, Karl F. Doerner, Margaretha Gansterer:
Secure and efficient routing on nodes, edges, and arcs of simple-graphs and of multi-graphs. 431-450 - Rodrigo Alexander Castro Campos, Cynthia A. Rodríguez Villalobos, Francisco Javier Zaragoza Martínez:
Plowing with precedence in polynomial time. 451-466 - Chahid Ahabchane, André Langevin, Martin Trépanier:
The mixed capacitated general routing problem with time-dependent demands. 467-484 - René van Bevern, Till Fluschnik, Oxana Yu. Tsidulko:
On approximate data reduction for the Rural Postman Problem: Theory and experiments. 485-508 - Roghayeh Hajizadeh, Kaj Holmberg:
A branch-and-dive heuristic for single vehicle snow removal. 509-521 - Wasin Padungwech, Jonathan M. Thompson, Rhyd Lewis:
Effects of update frequencies in a dynamic capacitated arc routing problem. 522-538 - Maurizio Bruglieri:
The parking warden tour problem. 539-554
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-02-21 19: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:
