AdONE Seminar - Monday, May 5, 2025: Prof. Kevin Tierney (Universität Bielefeld)

Title: tba

Date: May 5, 2025

Time: 5 pm, s.t.

Place: Arcisstr. 21, room 0501.EG.120

 

AdONE Seminar - Monday, May 12, 2025: Prof. Flore Sentenac (HEC Paris)

Title: tba

Date: May 12, 2025

Time: 5 pm, s.t.

Place: Arcisstr. 21, room 0505.Z1.534Z

 

AdONE Seminar - Monday, May 19, 2025: Prof. Yaoxin Wu (Eindhoven University of Technology)

Towards unifying neural combinatorial optimization through large language model

To advance capabilities of large language models (LLMs) in solving combinatorial optimization problems (COPs), this paper presents the Language-based Neural COP Solver (LNCS), a novel framework that is unified for the end-to-end resolution of diverse text-attributed COPs. LNCS leverages LLMs to encode problem instances into a unified semantic space, and integrates their embeddings with a Transformer-based solution generator to produce high-quality solutions. By training the solution generator with conflict-free multi-task reinforcement learning, LNCS effectively enhances LLM performance in tackling COPs of varying types and sizes, achieving state-of-the-art results across diverse problems. Extensive experiments validate the effectiveness and generalizability of the LNCS, highlighting its potential as a unified and practical framework for real-world COP applications.

Date: May 19, 2025

Time: 5 pm, s.t.

Place: Arcisstr. 21, room 0505.Z1.534Z

 

AdONE Seminar - Monday, June 2, 2025: Prof. Roel Leus (KU Leuven)

A flow-based formulation for parallel machine scheduling using decision diagrams

We present a new flow-based formulation for identical parallel machine scheduling with a regular objective function and without idle time.  The formulation is constructed with the help of a decision diagram that represents all job sequences that respect specific ordering rules. These rules rely on a partition of the planning horizon into, generally non-uniform, periods and do not exclude all optimal solutions, but they constrain solutions to adhere to a canonical form.  The new formulation has numerous variables and constraints, and hence we apply a Dantzig-Wolfe decomposition in order to compute the linear programming relaxation in reasonable time; the resulting lower bound is stronger than the bound from the classical time-indexed formulation. We develop a branch-and-price framework that solves several instances from the literature for the first time. We compare the new formulation with the time-indexed and arc-time-indexed formulation by means of a series of computational experiments.

Date: June 2, 2025

Time: 5 pm, s.t.

Place: Arcisstr. 21, room 0505.Z1.534Z

 

AdONE Seminar - Monday, June 23, 2025: Prof. Daniel Kuhn (EPFL)

Title: tba

Date: June 23, 2025

Time: 5 pm, s.t.

Place: Boltzmannstr. 3, room 00.07.014

 

AdONE Seminar - Monday, July 14, 2025: Prof. Max Klimm (TU Berlin)

Title: tba

Date: July 14, 2025

Time: 5 pm, s.t.

Place: Boltzmannstr. 3, room tba