default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 81
Volume 81, Number 1, January 2023
RESEARCH ARTICLES
- Sumin Kang, Manish Bansal
:
Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set. 3-22 - Antoine Oustry, Marion Le Tilly, Thomas Heide Clausen, Claudia D'Ambrosio, Leo Liberti:
Optimal deployment of indoor wireless local area networks. 23-50 - Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider:
EETTlib - Energy-efficient train timetabling library. 51-74 - Robert Benkoczi, Oluwaseun F. Lijoka:
Capacity provisioning for evacuation on path networks. 75-92 - Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
Improving a constructive heuristic for the general routing problem. 93-106 - Burak Boyaci, Thu Huong Dang, Adam N. Letchford:
Fast upper and lower bounds for a large-scale real-world arc routing problem. 107-124 - Zacharie Alès, Sourour Elloumi:
Minimizing recovery cost of network optimization problems. 125-151
Volume 81, Number 2, March 2023
RESEARCH ARTICLES
- Haochen Luo, Kiavash Kianfar:
Valid inequalities and facets for multi-module survivable network design problem. 155-176 - Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot:
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. 177-203 - Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore:
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. 204-219 - Hanoch Lev-Ari, Yariv Ephraim, Brian L. Mark:
Traffic rate network tomography with higher-order cumulants. 220-234 - Alberto Santini, Claudia Archetti:
The hazardous orienteering problem. 235-252 - Ralf Borndörfer, Stephan Schwartz, William Surau:
Vertex covering with capacitated trees. 253-277 - François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès:
Optimizing the ecological connectivity of landscapes. 278-293 - Mercedes Landete, Juanjo Peiró, Hande Yaman:
Formulations and valid inequalities for the capacitated dispersion problem. 294-315
Volume 81, Number 3, April 2023
RESEARCH ARTICLES
- Alejandra Casado, Nenad Mladenovic, Jesús Sánchez-Oro, Abraham Duarte:
Variable neighborhood search approach with intensified shake for monitor placement. 319-333 - Di H. Nguyen, Yongjia Song, J. Cole Smith:
A two-stage network interdiction-monitoring game. 334-358 - Pouria Arsalani, Mohammad Reisi-Nafchi, Vahid Dardashti, Ghasem Moslehi:
Two new mixed-integer programming models for the integrated train formation and shipment path optimization problem. 359-377 - Can Gokalp, Stephen D. Boyles, Avinash Unnikrishnan:
Mean-standard deviation model for minimum cost flow problem. 378-398 - Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa:
Solving vehicle routing problems with intermediate stops using VRPSolver models. 399-416
Volume 81, Number 4, June 2023
RESEARCH ARTICLES
- Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas:
Network augmentation for disaster-resilience against geographically correlated failure. 419-444 - Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins:
A combinatorial branch and bound for the safe set problem. 445-464 - M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan:
Maximum weight perfect matching problem with additional disjunctive conflict constraints. 465-489 - Christina Graves:
More reliable graphs are not always stronger. 490-498 - Nicola Bianchessi:
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm. 499-513
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-09-28 01:27 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:
