Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID10th INOC 2022: Aachen, Germany
- Christina Büsing, Arie M. C. A. Koster:
Proceedings of the 10th International Network Optimization Conference, INOC 2022, Aachen, Germany, June 7-10, 2022. OpenProceedings.org 2022, ISBN 978-3-89318-090-5
Front Matter
- Christina Büsing, Arie M. C. A. Koster:
Foreword. 1-4
Research Paper
- Pedro H. Fernandes da Silva, Hervé Kervin, Juan Pablo Nant, Annegret Wagler:
A framework for routing and spectrum assignment in optical networks, driven by combinatorial properties. 1-6 - Mariia Anapolska, Christina Büsing, Tabea Krabs
, Tobias Mömke:
Coworking Scheduling with Network Flows. 1-6 - Hao Pan, Balabhaskar Balasundaram, Juan Sebastian Borrero:
A Decomposition Branch-and-Cut Algorithm for the Maximum Cross-Graph k-Club Problem. 1-6 - Julien Khamphousone, André Rossi, Fabián Castaño, Sonia Toubaline:
A robust variant of the Ring Star Problem. 1-6 - Phillippe Samer, Dag Haugland:
Towards Stronger Lagrangean Bounds for Stable Spanning Trees. 1-5 - Rafael Colares, Amal Benhamiche, Yannick Carlinet, Nancy Perrot:
A branch-and-cut algorithm for the availability-aware VNF placement problem in virtualized networks. 1-6 - Oliver Bachtler, Tim Bergner, Sven O. Krumke:
Local Certification of Reachability. 1-5 - Timo Kreimeier, Martina Kuchlbauer, Frauke Liers, Michael Stingl, Andrea Walther:
Towards the Solution of Robust Gas Network Optimization Problems Using the Constrained Active Signature Method. 1-6 - Giulia Caselli, Giomaria Columbu, Manuel Iori, Carlo Alberto Magni:
Mixed Integer Linear Programming for CO2 emissions minimization in a Waste Transfer Facility Location Problem. 1-6 - Christina Büsing, Arie Koster, Sabrina Schmitz:
On the complexity of robust transshipment under consistent flow constraints. 1-6 - Ralf Borndörfer, Stephan Schwartz, William Surau:
Rooted Maximum Weight Connected Subgraphs with Balancing and Capacity Constraints. 1-6 - Artur Tomaszewski, Michal Pióro, Mariusz Mycek:
Max-Min Optimization of Controller Placements vs. Min-Max Optimization of Attacks on Nodes in Service Networks. 1-6 - Youcef Magnouche, Sébastien Martin, Jérémie Leguay, Francesco De Pellegrini, Rachid Elazouzi, Cédric Richier:
Branch-and-Benders-Cut Algorithm for the Weighted Coflow Completion Time Minimization Problem. 1-6 - Christina Büsing, Timo Gersing, Sophia Wrede:
Analysing the Complexity of Facility Location Problems with Capacities, Revenues, and Closest Assignments. 1-6 - Amirreza Pashapour, Dilek Günneç, F. Sibel Salman, Eda Yücel:
A Capacitated Mobile Facility Location Problem with Mobile Demand: Recurrent Service Provision to En Route Refugees. 1-6 - Minh Hieu Nguyen, Viet Hung Nguyen, Thi Quynh Trang Vo, Mourad Baïou:
Nash fairness solutions for balanced TSP. 1-6 - Giorgio Zucchi, Victor H. V. Corrêa, André G. Santos, Manuel Iori, Mutsunori Yagiura:
A Metaheuristic Algorithm for a Multi-period Orienteering Problem arising in a Car Patrolling Application. 1-6 - Philine Schiewe, Moritz Stinzendörfer:
Integrated Line Planning and Vehicle Scheduling for Public Transport. 1-6
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:01 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
