default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNetworks, Volume 82
Volume 82, Number 1, July 2023
- Issue Information. 1-2
- Cédric Bentz, Marie-Christine Costa
, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated Steiner trees and networks with uniform demands. 3-31 - Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot:
Two extended formulations for the virtual network function placement and routing problem. 32-51 - Pasquale Avella, Alice Calamita, Laura Palagi:
A compact formulation for the base station deployment problem in wireless networks. 52-67 - Igor Averbakh, Wei Yu:
The probabilistic uncapacitated open vehicle routing location problem. 68-83
Volume 82, Number 2, September 2023
- Issue Information. 85-86
- Fábio Barbosa, Amaro de Sousa, Agostinho Agra:
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. 87-110 - Kyle MacKeigan, Danielle Cox, Emily Wright:
Existence of optimally-greatest digraphs for strongly connected node reliability. 111-128 - Masoud Eshghali, Pavlo A. Krokhmal:
Risk-averse optimization and resilient network flows. 129-152 - Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern:
Achieving feasibility for clustered traveling salesman problems using PQ-trees. 153-166 - Oliverio Cruz-Mejia, Adam N. Letchford:
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. 167-176 - Jason I. Brown, Isaac McMullin:
On the split reliability of graphs. 177-185
Volume 82, Number 3, October 2023
- Issue Information. 187-188
- Pengfei He, Jin-Kao Hao, Qinghua Wu:
Hybrid genetic algorithm for undirected traveling salesman problems with profits. 189-221 - Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi, Valeriu Beiu:
Reliability polynomials of consecutive-k-out-of-n:Fsystems have unbounded roots. 222-228 - Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Jian-Hua Yuan, Hou-Shan Zhang:
Efficient presolving methods for the influence maximization problem. 229-253 - Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle:
A new MILP formulation for the flying sidekick traveling salesman problem. 254-276 - Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer:
Targeted multiobjective Dijkstra algorithm. 277-298
Volume 82, Number 4, December 2023
- Issue Information. 299-300
- Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente:
A genetic approach for the 2-edge-connected minimum branch vertices problem. 301-317 - Xabier Martin, Javier Panadero, David Peidro, Elena Pérez-Bernabeu, Angel A. Juan:
Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times. 318-335 - Michele Barbato, Francisco Canas, Luís Gouveia, Pierre Pesneau:
Node based compact formulations for the Hamiltonian p-median problem. 336-370 - Elisabeth Gaar, Markus Sinnl:
Exact solution approaches for the discrete α-neighbor p-center problem. 371-399 - Nho Minh Dinh, Claudia Archetti, Luca Bertazzi:
The inventory routing problem with split deliveries. 400-413 - Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena:
Two-stage stochastic one-to-many driver matching for ridesharing. 414-436 - James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura:
The multi-purpose K-drones general routing problem. 437-458 - Hugo Callebaut, Jérôme De Boeck, Bernard Fortz:
Preprocessing for segment routing optimization. 459-478 - Saurav Agarwal, Srinivas Akella:
The single robot line coverage problem: Theory, algorithms, and experiments. 479-505 - Rico Kötschau, Ninja Soeffker, Jan Fabian Ehmke:
Mobile parcel lockers with individual customer service. 506-526 - Josep Fàbrega, Jaume Martí-Farré, Xavier Muñoz:
Distance-layer structure of the De Bruijn and Kautz digraphs: Analysis and application to deflection routing. 527-550 - Elena Fernández, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Connected graph partitioning with aggregated and non-aggregated gap objective functions. 551-570 - Farnaz Farzadnia, Tolga Bektas, Jens Lysgaard:
The cumulative school bus routing problem: Polynomial-size formulations. 571-591
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-11 21:30 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:
