| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mette Gamst, David Pisinger |
Decision support for the technician routing and scheduling problem.  |
Networks  |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Rossana Cavagnini, Michael Schneider 0004, Alina Theiß |
A granular iterated local search for the asymmetric single truck and trailer routing problem with satellite depots at DHL Group. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | She'ifa Z. Punla-Green, John E. Mitchell 0001, Jared L. Gearhart, William E. Hart, Cynthia A. Phillips |
Shortest path network interdiction with asymmetric uncertainty. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Nadine Friesen, Tim Sander, Christina Büsing, Karl Nachtigall, Nils Nießen |
The complexity of the timetable-based railway network design problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Michal Pióro, Mariusz Mycek, Artur Tomaszewski, Amaro de Sousa |
Maximizing SDN resilience to node-targeted attacks through joint optimization of the primary and backup controllers placements. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marco Antonio Boschetti, Stefano Novellani |
Last-mile delivery with drone and lockers. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Minh Hieu Nguyen, Mourad Baïou, Viet Hung Nguyen, Thi Quynh Trang Vo |
Generalized nash fairness solutions for bi-objective minimization problems. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Balázs Vass, Beáta Éva Nagy, Balázs Brányi, János Tapolcai |
The complexity landscape of disaster-aware network extension problems. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Georg E. A. Froehlich, Margaretha Gansterer, Karl F. Doerner |
A rolling horizon framework for the time-dependent multi-visit dynamic safe street snow plowing problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Corinna Mathwieser, Eranda Çela |
Special cases of the minimum spanning tree problem under explorable edge and vertex uncertainty. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Fortz, Mariusz Mycek, Michal Pióro, Artur Tomaszewski |
Min-max optimization of node-targeted attacks in service networks. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcelo Rodrigues de Holanda Maia, Alexandre Plastino 0001, Uéverton dos Santos Souza |
An improved hybrid genetic search with data mining for the CVRP. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton |
A continuous-time service network design and vehicle routing problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Julien Khamphousone, Fabián Castaño, André Rossi, Sonia Toubaline |
A survivable variant of the ring star problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Amelkin, Rakesh Vohra |
Yield uncertainty and strategic formation of supply chain networks. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Konstantin Pavlikov, Niels Christian Petersen, Jon Lilholt Sørensen |
Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Eugene Lykhovyd, Sergiy Butenko, Pavlo A. Krokhmal |
Asymptotic bounds for clustering problems in random graphs. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Marta Baldomero-Naranjo, Jörg Kalcsics, Antonio M. Rodríguez-Chía |
On the complexity of the upgrading version of the maximal covering location problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Lorenzo Balzotti, Paolo Giulio Franciosa |
How vulnerable is an undirected planar graph with respect to max flow. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Akiyoshi Shioura, Vitaly A. Strusevich, Natalia V. Shakhlevich |
Generalizing Horn's conditions for preemptive scheduling on identical parallel machines via network flow techniques. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Mouad Morabit, Guy Desaulniers, Andrea Lodi 0001 |
Learning to repeatedly solve routing problems. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Bryan David Galarza Montenegro, Kenneth Sörensen, Pieter Vansteenwegen |
A demand-responsive feeder service with a maximum headway at mandatory stops. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Rossana Cavagnini, Michael Schneider 0004, Alina Theiß |
A tabu search with geometry-based sparsification methods for angular traveling salesman problems. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanane Biallach, Mustapha Bouhtou, Kristina Kumbria, Dritan Nace, Artur Tomaszewski |
Virtual network function reconfiguration in 5G networks: An optimization perspective. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | David Pisinger, Siv Sørensen |
Topology reconstruction using time series data in telecommunication networks. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengfei He, Jin-Kao Hao, Qinghua Wu 0002 |
A hybrid genetic algorithm for the Hamiltonian p-median problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro H. Fernandes da Silva, Hervé Kerivin, Juan Pablo Nant, Annegret Katrin Wagler |
Solving the routing and spectrum assignment problem, driven by combinatorial properties. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Ankur Garg, Yogesh Agarwal, Rajiv Kumar Srivastava, Suresh Kumar Jakhar |
Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Büsing, Arie M. C. A. Koster, Sabrina Schmitz |
Robust transshipment problem under consistent flow constraints. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Rebekka Haese, Till Heller, Sven O. Krumke |
Algorithms and complexity for the almost equal maximum flow problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Edoardo Fadda, Evelina Di Corso, Davide Brusco, Vlad Stefan Aelenei, Alexandru Balan Rares |
Math-based reinforcement learning for the adaptive budgeted influence maximization problem. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Guillaume Ducoffe |
Balancing graph Voronoi diagrams with one more vertex. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Victor Hugo Vidigal Corrêa, Hang Dong, Manuel Iori, André Gustavo dos Santos, Mutsunori Yagiura, Giorgio Zucchi |
An iterated local search for a multi-period orienteering problem arising in a car patrolling application. |
Networks |
2024 |
DBLP DOI BibTeX RDF |
|
| 1 | Masoud Eshghali, Pavlo A. Krokhmal |
Risk-averse optimization and resilient network flows. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Issue Information. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | James F. Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis, Paula Segura |
The multi-purpose K-drones general routing problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Maurizio Boccia, Andrea Mancuso, Adriano Masone, Claudio Sterle |
A new MILP formulation for the flying sidekick traveling salesman problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Elena Fernández, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari |
Connected graph partitioning with aggregated and non-aggregated gap objective functions. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Di H. Nguyen, Yongjia Song, J. Cole Smith |
A two-stage network interdiction-monitoring game. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Robert Benkoczi, Oluwaseun F. Lijoka |
Capacity provisioning for evacuation on path networks. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicola Bianchessi |
On optimally solving sub-tree scheduling for wireless sensor networks with partial coverage: A branch-and-cut algorithm. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marilena Jianu, Leonard Daus, Vlad-Florin Dragoi, Valeriu Beiu |
Reliability polynomials of consecutive-k-out-of-n:Fsystems have unbounded roots. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Issue Information. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Can Gokalp, Stephen D. Boyles, Avinash Unnikrishnan |
Mean-standard deviation model for minimum cost flow problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Oliverio Cruz-Mejia, Adam N. Letchford |
A survey on exact algorithms for the maximum flow and minimum-cost flow problems. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pengfei He, Jin-Kao Hao, Qinghua Wu 0002 |
Hybrid genetic algorithm for undirected traveling salesman problems with profits. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniele Ferone, Paola Festa, Serena Fugaro, Tommaso Pastore |
The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hugo Callebaut, Jérôme De Boeck, Bernard Fortz |
Preprocessing for segment routing optimization. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Boggio Tomasaz, Roberto Cordone, Pierre Hosteins |
A combinatorial branch and bound for the safe set problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Fábio Barbosa, Amaro de Sousa, Agostinho Agra |
Provision of maximum connectivity resiliency with minimum cost to telecommunication networks through third-party networks. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyle MacKeigan, Danielle Cox, Emily Wright |
Existence of optimally-greatest digraphs for strongly connected node reliability. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Igor Averbakh, Wei Yu |
The probabilistic uncapacitated open vehicle routing location problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nho Minh Dinh, Claudia Archetti, Luca Bertazzi |
The inventory routing problem with split deliveries. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | M. Hakan Akyüz, I. Kuban Altinel, Temel Öncan |
Maximum weight perfect matching problem with additional disjunctive conflict constraints. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sumin Kang, Manish Bansal |
Distributionally risk-receptive and risk-averse network interdiction problems with general ambiguity set. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Rico Kötschau, Ninja Soeffker, Jan Fabian Ehmke |
Mobile parcel lockers with individual customer service. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alberto Santini, Claudia Archetti |
The hazardous orienteering problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Bärmann, Patrick Gemander, Lukas Hager, Frederik Nöth, Oskar Schneider |
EETTlib - Energy-efficient train timetabling library. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont |
Robust capacitated Steiner trees and networks with uniform demands. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Marcos Costa Roboredo, Ruslan Sadykov, Eduardo Uchoa |
Solving vehicle routing problems with intermediate stops using VRPSolver models. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ahlam Mouaci, Éric Gourdin, Ivana Ljubic, Nancy Perrot |
Two extended formulations for the virtual network function placement and routing problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Antoine Oustry, Marion Le Tilly, Thomas Heide Clausen, Claudia D'Ambrosio, Leo Liberti |
Optimal deployment of indoor wireless local area networks. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pedro Maristany de las Casas, Luitgard Kraus, Antonio Sedeño-Noda, Ralf Borndörfer |
Targeted multiobjective Dijkstra algorithm. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Filippo Brunelli, Pierluigi Crescenzi, Laurent Viennot |
Maximizing reachability in a temporal graph obtained by assigning starting times to a collection of walks. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Michele Barbato, Francisco Canas, Luís Gouveia 0001, Pierre Pesneau |
Node based compact formulations for the Hamiltonian p-median problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nili Guttmann-Beck, Hadas Meshita-Sayag, Michal Stern |
Achieving feasibility for clustered traveling salesman problems using PQ-trees. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Sheng-Jie Chen, Weikun Chen, Yu-Hong Dai, Jian-Hua Yuan, Hou-Shan Zhang |
Efficient presolving methods for the influence maximization problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Burak Boyaci, Thu Huong Dang, Adam N. Letchford |
Fast upper and lower bounds for a large-scale real-world arc routing problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Zacharie Alès, Sourour Elloumi |
Minimizing recovery cost of network optimization problems. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Issue Information. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Francesco Carrabs, Raffaele Cerulli, Federica Laureana, Domenico Serra, Carmine Sorgente |
A genetic approach for the 2-edge-connected minimum branch vertices problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Saurav Agarwal, Srinivas Akella |
The single robot line coverage problem: Theory, algorithms, and experiments. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Elisabeth Gaar, Markus Sinnl |
Exact solution approaches for the discrete α-neighbor p-center problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Haochen Luo, Kiavash Kianfar |
Valid inequalities and facets for multi-module survivable network design problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Gabriel Homsi, Bernard Gendron, Sanjay Dominik Jena |
Two-stage stochastic one-to-many driver matching for ridesharing. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Hanoch Lev-Ari, Yariv Ephraim, Brian L. Mark |
Traffic rate network tomography with higher-order cumulants. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Alejandra Casado, Nenad Mladenovic, Jesús Sánchez-Oro, Abraham Duarte |
Variable neighborhood search approach with intensified shake for monitor placement. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | |
Issue Information. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Burak Boyaci, Thu Huong Dang, Adam N. Letchford |
Improving a constructive heuristic for the general routing problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Jason I. Brown, Isaac McMullin |
On the split reliability of graphs. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Christina Graves |
More reliable graphs are not always stronger. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Farnaz Farzadnia, Tolga Bektas, Jens Lysgaard |
The cumulative school bus routing problem: Polynomial-size formulations. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Ralf Borndörfer, Stephan Schwartz, William Surau |
Vertex covering with capacitated trees. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Nicolau Andrés-Thió, Marcus Brazil, Charl J. Ras, Doreen A. Thomas |
Network augmentation for disaster-resilience against geographically correlated failure. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Pasquale Avella, Alice Calamita, Laura Palagi |
A compact formulation for the base station deployment problem in wireless networks. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | François Hamonic, Cécile Albert, Basile Couëtoux, Yann Vaxès |
Optimizing the ecological connectivity of landscapes. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Mercedes Landete, Juanjo Peiró, Hande Yaman |
Formulations and valid inequalities for the capacitated dispersion problem. |
Networks |
2023 |
DBLP DOI BibTeX RDF |
|
| 1 | Saeid Rasti, Chrysafis Vogiatzis |
Novel centrality metrics for studying essentiality in protein-protein interaction networks based on group structures. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Gross, Nathan Kahl, Kristi Luttrell, John T. Saccoman |
Dr. Charles L. Suffel: Scholar, teacher, mentor, friend. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Joshua T. Margolis, Yongjia Song, Scott J. Mason |
A multi-vehicle covering tour problem with speed optimization. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniela Bubboloni, Michele Gori |
Paths and flows for centrality measures in networks. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Oded Berman, Jiamin Wang |
The multifacility center problems with random demand weights. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Csilla Bujtás, Marko Jakovac, Zsolt Tuza |
The k-path vertex cover: General bounds and chordal graphs. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Bernard Fortz, Luis Gouveia 0001, Pedro Moura 0002 |
A comparison of node-based and arc-based hop-indexed formulations for the Steiner tree problem with hop constraints. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Yogesh Kumar Agarwal, Prahalad Venkateshan |
New valid inequalities for the symmetric vehicle routing problem with simultaneous pickup and deliveries. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Aldair Alvarez, Jean-François Cordeau, Raf Jans |
The consistent production routing problem. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
| 1 | Burak Boyaci, Thu Huong Dang, Adam N. Letchford |
On matchings, T-joins, and arc routing in road networks. |
Networks |
2022 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license