Proceedings of the 10^th International Network Optimization Conference (INOC), Aachen, Germany, June 7–10, 2022

Series ISSN: 2510-7437

Original publisher: OpenProceedings.org, ISBN: 978-3-89318-090-5, Electronic Edition

Foreword

Christina Büsing, Arie M. C. A. Koster pp. 1–4

A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties

Pedro H. Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret Wagler pp. 5–10

Coworking Scheduling with Network Flows

Mariia Anapolska, Christina Büsing, Tabea Krabs, Tobias Mömke pp. 11–16

A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem

Hao Pan, Balabhaskar Balasundaram, Juan Borrero pp. 17–22

A robust variant of the Ring Star Problem

Julien Khamphousone, André Rossi, Fabián Castaño, Sonia Toubaline pp. 23–28

Towards Stronger Lagrangean Bounds for Stable Spanning Trees

Phillippe Samer, Dag Haugland pp. 29–33

A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks

Rafael Colares, Amal Benamiche, Yannick Carlinet, Nancy Perrot pp. 34–39

Local Certification of Reachability

Oliver Bachtler, Tim Bergner, Sven O. Krumke pp. 40–44

Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method

Timo Kreimeier, Martina Kuchlbauer, Frauke Liers, Michael Stingl, Andrea Walther pp. 45–50

Mixed Integer Linear Programming for CO2 emissions minimization in a Waste Transfer Facility Location Problem

Giulia Caselli, Giomaria Columbu, Manuel Iori, Carlo Alberto Magni pp. 51–56

On the complexity of robust transshipment under consistent flow constraints

Christina Büsing, Arie Koster, Sabrina Schmitz pp. 57–62

Rooted Maximum Weight Connected Subgraphs with Balancing and Capacity Constraints

Ralf Borndoerfer, Stephan Schwartz, William Surau pp. 63–68

Max-Min Optimization of Controller Placements vs. Min-Max Optimization of Attacks on Nodes in Service Networks

Artur Tomaszewski, Michal Pioro, Mariusz Mycek pp. 69–74

Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem

Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cedric Richier pp. 75–80

Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments

Christina Büsing, Timo Gersing, Sophia Wrede pp. 81–86

A Capacitated Mobile Facility Location Problem with Mobile Demand: Recurrent Service Provision to En Route Refugees

Amirreza Pashapour, Dilek Gunnec, Sibel Salman, Eda Yucel pp. 87–92

Nash fairness solutions for balanced TSP

Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baiou pp. 93–98

A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application

Giorgio Zucchi, Victor H. V. Corrêa, André G. Santos, Manuel Iori, Mutsunori Yagiura pp. 99–104

Integrated Line Planning and Vehicle Scheduling for Public Transport

Philine Schiewe, Moritz Stinzendörfer pp. 105–110

Proceedings of the 10th International Network Optimization Conference (INOC), Aachen, Germany, June 7–10, 2022