Abstract is missing.
- ForewordPaula Carroll, Deepak Ajwani. 1-3 [doi]
- Ensemble pruning via an integer programming approach with diversity constraintsMarcelo Antônio Mendes Bastos, Humberto Brandão, Cristiano Arbex Valle. 4-9 [doi]
- Survivable Traffic Grooming with Practical Constraints in Large-Scale Optical NetworkJianwei Niu, Junyan Liu, Fan Zhang 0016, Fabo Sun, Kerong Yan, Junqi Ma 0004. 10-15 [doi]
- Multi-Objective Multi-Commodity Flow Optimization for Wartime Planning with Cyber-EffectsAlex Hoffendahl, Chancellor Johnstone, Alex Stephens, Richard Dill, Lance E. Champagne. 16-21 [doi]
- Digraphs and k-Domination Models for Facility Location Problems in Road Networks: Greedy HeuristicsLukas Dijkstra, Andrei Gagarin, Padraig Corcoran, Rhyd Lewis. 22-27 [doi]
- On the nested p-center problemChristof Brandstetter, Markus Sinnl. 28-33 [doi]
- In-Band Network Telemetry for Efficient Congestion MitigationYoucef Magnouche, Sébastien Martin, Jeremie Leguay, Paolo Medagliani. 34-39 [doi]
- Learning to Prune Instances of Steiner Tree Problem in GraphsJiwei Zhang 0013, Dena Tayebi, Saurabh Ray, Deepak Ajwani. 40-45 [doi]
- Compact and non-compact formulations for the Dominated Coloring ProblemDilson Lucas Pereira, Abilio Lucena, Alexandre Salles da Cunha. 46-51 [doi]
- Exploring quantum optimization for solving the PCI planning problem in 5G networksErico Teixeira, Adriano Borges, Pamela Bezerra. 52-57 [doi]
- A Multi-Swap Heuristic for Rolling Stock Rotation Planning with Predictive MaintenanceFelix Prause. 58-63 [doi]
- Multi-depot split delivery of batchesCríston Souza, Andréa Santos. 64-69 [doi]
- A Guided Insertion Mechanism for Solving the Dynamic Large-Scale Dial-a-Ride ProblemChijia Liu, Alain Quilliot, Hélène Toussaint, Dominique Feillet. 70-75 [doi]
- An Improved Single-Commodity Flow Formulation for the Vehicle Routing Problem with a Heterogeneous FleetDevanand. 76-80 [doi]