Series ISSN: 2510-7437
Original publisher: OpenProceedings.org, ISBN: 978-3-89318-096-7, Electronic Edition
Front Matter
Research Paper
![[PDF]](../pdf.png "Download local copy")
![[DOI]](../url.png "Get via DOI")
Ensemble pruning via an integer programming approach with diversity constraints
Marcelo Antônio Mendes Bastos, Humberto Brandão, Cristiano Arbex Valle
pp. 4–9
Survivable Traffic Grooming with Practical Constraints in Large-Scale Optical Network
Jianwei Niu, Junyan Liu, Fan Zhang, Fabo Sun, Kerong Yan, Junqi Ma
pp. 10–15
Multi-Objective Multi-Commodity Flow Optimization for Wartime Planning with Cyber-Effects
Alex Hoffendahl, Chancellor Johnstone, Alex Stephens, Richard Dill, Lance Champagne
pp. 16–21
Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy Heuristics
Lukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis
pp. 22–27
In-Band Network Telemetry for Efficient Congestion Mitigation
Youcef Magnouche, Sébastien Martin, Jeremie Leguay, Paolo Medagliani
pp. 34–39
Learning to Prune Instances of Steiner Tree Problem in Graphs
Jiwei Zhang, Dena Tayebi, Saurabh Ray, Deepak Ajwani
pp. 40–45
Compact and non-compact formulations for the Dominated Coloring Problem
Dilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha
pp. 46–51
Exploring quantum optimization for solving the PCI planning problem in 5G networks
Erico Teixeira, Adriano Borges, Pamela Bezerra
pp. 52–57
A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive Maintenance
Felix Prause
pp. 58–63
A Guided Insertion Mechanism for Solving the Dynamic Large-Scale Dial-a-Ride Problem
Chijia Liu, Alain Quilliot, Hélène Toussaint, Dominique Feillet
pp. 70–75
An Improved Single-Commodity Flow Formulation for the Vehicle Routing Problem with a Heterogeneous Fleet
Devanand Devanand
pp. 76–80
Except where otherwise noted, content on this site is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.