Series ISSN: 2510-7437
Publication date: April 15, 2026
Original publisher: OpenProceedings.org, ISBN: 978-3-89318-105-6, Electronic Edition
Front Matter
Research Paper
![[PDF]](../pdf.png "Download local copy")
![[DOI]](../url.png "Get via DOI")
Stronger and faster semidefinite programming bounds for the p-median Quadratic Facility Location Problem
Dilson Lucas Pereira, Alexandre Salles da Cunha
pp. 11–16
Putting Tutte's counterexample to Tait's conjecture in perspective to Hamiltonicity and non-Hamiltonicity in certain planar cubic graphs
Herbert Fleischner, Enrico Iurlano, Günther R. Raidl
pp. 17–20
Optimising Peak Cost Over Fractional Temporally Repeated Flows
Mariia Anapolska, Christina Büsing, Marius Schieren, Rhyd Lewis
pp. 21–26
On The Minimum-Weight Forward (Weakly) Fundamental Cycle Basis Problem in Directed Graphs
Gabor Riccardi, Niels Lindner
pp. 27–32
Network Abstraction with Provisioning Guarantees for Multi-Domain Virtual Network Embedding
Yanis Achaichia, Christelle Caillouet, Nicolas Huin, Geraldine Texier
pp. 33–38
A Three-Stage Meta-Heuristic-Based Framework for Voltage
Estimation in Low-Voltage Distribution Grids
Mohsen Banaei, Ahlam Jameel, Eghbal Hosseini, Fraser O'Brien, Razgar Ebrahimi
pp. 39–44
Exact approach for the 2-Vertex-Connected Star problem
Louis Kurdyk, André Rossi, Sonia Toubaline
pp. 45–50
Energy Community PV Facility Location Optimisation
Dena Tayebi, Paula Carroll, Debajyoti Biswas
pp. 51–56
Finding Minimal Discretizations in Dynamic Discretization Discovery for Continuous-Time Service Network Design
Tom Wüllner, Alexander Helber, Pamela Bezerra
pp. 57–62
Robust Optimization On Partial Network Design
Dimitri Hubans, Sonia Cafieri, Laurent Houssin
pp. 63–68
Advancing Security and Sustainability in Cost-Effective Multi-Band Flexible-Grid Optical Networks: Optimization Models and Algorithms
Ibrahima Diarrasouba, Youssouf Hadhbi, A. Ridha Mahjoub
pp. 76–81
Globally balanced paths for minimizing congestion in HPC networks
Jan De Neve, Wouter Tavernier, Didier Colle, Mario Pickavet
pp. 82–87
Overlapping decompositions of Virtual Network Embedding
Alexis Schneider, Amal Benhamiche, Pierre Fouilhoux, Lucas Létocart, Nancy Perrot
pp. 88–93
Column Generation-Based Heuristic for the Sweep Coverage Problem
Fabrizio Marinelli, Andrea Pizzuti, Nicola Ronchini
pp. 94–99
Joint Admission Control and Embedding of SFC Requests in a Stochastic Environment for Maximizing Network Revenue
Daniela Cuesta, Olivier Brun, Matthieu Jonckheere, Balakrishna Prabhu
pp. 100–105
Energy-Efficient Function Chaining and Assignment for In-Network Learning
Garance Gérard, Patient Ntumba, Safia Kedad-Sidhoum, Amélie Lambert, Nancy Perrot
pp. 106–111
The Power of Symmetric Spanning Graphs in Public Transport
Irene Heinrich, Olli Herrala, Piyalee Pattanaik, Philine Schiewe
pp. 112–117
A consolidation heuristic for a biobjective multimodal transportation planning problem
Dominik Leib, Neele Leithäuser
pp. 118–123
Solving the Rooted, Capacitated, Maximum Weight Connected Subgraph Problem on Graphs with Bounded Treewidth
William Surau, Ralf Borndörfer
pp. 124–128
The Power of Symmetric Spanning Graphs in Public Transport
Ryan O'Connor, Johannes Meintrup, Maximilian Huber, Alexander Leonhardt, Manuel Penschuck, Yosuke Mizutani, Oscar Yeoh, Deepak Ajwani
pp. 129–134
Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.