25 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

26 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

  • [SAn] Gauge transform for the Korteweg-de Vries equation and well-posedness below the H^{-1}-scale | Simão Correia (Instituto Superior Técnico, Universidade de Lisboa)

    26 March 2026 - 15:00 - 16:00

    In this talk, I will present a new formulation of the Korteweg-de Vries equation (KdV) on the real line, via a gauge transform. While KdV and the gauged equation are equivalent for smooth solutions, the latter is better-behaved for initial data at lower regularities. In particular, the admissible regularities go beyond the $H^{-1}$-scale, which is a well-known threshold for KdV. As a byproduct, by reversing the gauge transform, we are able to improve on the theory for KdV. Additionally, our method is totally independent of the KdV complete integrability structure, and extends to other non-integrable models with quadratic nonlinearities. 
    I will focus mainly on the derivation of the gauged equation: using tree graphs and some basic combinatorics, we will uncover a hidden structure which then gives rise to the announced gauge transform. This is joint work with Andreia Chapouto (CNRS, Monash University, Australia) and João Pedro Ramos (IMPA, Brazil).

    See more details

27 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

28 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

29 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

30 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

31 March 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

1 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

2 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

3 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

4 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

5 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

6 April 2026

  • [VAL] Charles Johnson (The College of William & Mary, Williamsburg, Virginia, USA)

    25 March 2026 - 6 April 2026 - 

    See more details

8 April 2026

  • [SOR] The Precedence-Constrained Family Traveling Salesman Problem | Raquel Bernardino (Department of Mathematics, Lisbon School of Economics and Management (ISEG))

    8 April 2026 - 14:30 - 15:30

     

    Title: The Precedence-Constrained Family Traveling Salesman Problem

    Speaker:  Raquel Bernardino, Department of Mathematics, Lisbon School of Economics and Management (ISEG)


    Date | Time: April 8, 2026 | 14h30

    Place: NOVA FCT,

    Abstract:

    We introduce the Precedence-Constrained Family Traveling Salesman Problem (PC- FTSP), which generalizes the FTSP by adding precedence relations between families. The PC-FTSP arises in warehouse order picking with scattered storage, where heavier items must be picked before lighter ones. We propose several formulations and compare them theoretically and empirically. We also derive valid inequalities that strengthen the linear programming (LP) relaxations. As some formulations are non- compact, we design a branch-and-cut algorithm to solve them. Results show the non- compact formulations outperform the compact ones, and the inequalities effectively strengthen the LP bounds on our instances.

    See more details