View the program in our Progressive Web App
Program for stream Network Optimization
Sunday
Monday
Tuesday
Wednesday
Wednesday, 8:30-10:00
WA-31: Scheduling and Networks
Stream: Network Optimization
Room: Virtual Room 31
Chair(s):
Tristan Becker
-
Shrinking of support graphs in cycle problems
Gorka Kobeaga, María Merino, Jose A. Lozano -
A New Approach to Model and Solve the Hierarchical Interval Schedule Problem with Machine Availibility
Zhang Jiarui -
Developmental Cost Optimisation of Water Distribution Networks
Saumya Goyal, Om Damani, Ashutosh Mahajan -
A General Algorithmic Framework for Rotating Workforce Scheduling
Tristan Becker, Maximilian Schiffer, Grit Walther
Wednesday, 10:30-12:00
WB-31: Networks, Flows, and Applications
Stream: Network Optimization
Room: Virtual Room 31
Chair(s):
Clemens Thielen, Jan Boeckmann
-
On the biobjective shortest path network interdiction problem
Luca Schäfer, Stefan Ruzika -
Multistage stochastic capacity planning in networks
Anthony Downward, Andy Philpott -
Column generation bounds on a network flow model to minimize the total weighted completion time for a single parallel batching machine
Alessandro Druetto, Andrea Grosso -
Approximating Network Flow Interdiction with Unit Costs
Jan Boeckmann, Clemens Thielen
Wednesday, 12:30-14:00
WC-31: Influence maximization in (social) networks
Stream: Network Optimization
Room: Virtual Room 31
Chair(s):
Michael Kahr
-
Two-Level Influence Maximization Problem under Deterministic Linear Threshold Model
Dilek Gunnec, Doruk Eski, Mihail Duscu -
Fairness in Influence Maximization through Randomization
Hugo Gilbert, Ruben Becker, Gianlorenzo D'Angelo, Sajjad Ghobadi -
Multinomial logit models for competitive influence maximization
Michael Kahr, Markus Leitner, Ivana Ljubic
Wednesday, 14:30-16:00
WD-31: Design and Analysis of Networks
Stream: Network Optimization
Room: Virtual Room 31
Chair(s):
Austin Benson
-
Steiner tree problem with hop constraints: a comparison between node-based and arc-based hop-indexed formulations
Pedro Moura, Luís Gouveia, Bernard Fortz -
Hypergraph Cuts with Generalized Splitting Functions
Austin Benson -
Hypergraph Homophily is Combinatorially Impossible
Nate Veldt, Austin Benson -
Characterization of QUBO reformulations for the maximum k-colorable subgraph problem
Rodolfo Alexander Quintero Ospina, David E. Bernal, Tamás Terlaky, Luis Zuluaga