A reclaimer scheduling problem arising in coal stockyard management

- Angelelli, Enrico, Kalinowski, Thomas, Kapoor, Reena, Savelsbergh, Martin W.

Welfare of sequential allocation mechanisms for indivisible goods

- Aziz, Haris, Kalinowski, Thomas, Walsh, Toby, Xia, Lirong

Incremental network design with shortest paths

- Baxter, Matthew, Elgindy, Tarek, Ernst, Andreas T., Kalinowski, Thomas, Savelsbergh, Martin W. P.

New multi-commodity flow formulations for the pooling problem

- Boland, Natashia, Kalinowski, Thomas, Rigterink, Fabian

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain

- Boland, Natashia, Kalinowski, Thomas, Waterer, Hamish, Zheng, Lanbo

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

- Boland, Natashia, Dumitrescu, Irina, Froyland, Gary, Kalinowski, Thomas

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions

- Boland, Natashia, Dey, Santanu S., Kalinowski, Thomas, Molinaro, Marco, Rigterink, Fabian

A polynomially solvable case of the pooling problem

- Boland, Natashia, Kalinowski, Thomas, Rigterink, Fabian

Scheduling arc maintenance jobs in a network to maximise total flow over time

- Boland, Natashia, Kalinowski, Thomas, Waterer, Hamish, Zheng, Lanbo

Scheduling unit time arc shutdowns to maximize network flow over time: complexity results

- Boland, Natashia, Kapoor, Reena, Kaur, Simranjit, Kalinowski, Thomas

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

- Boland, Natashia, Kalinowski, Thomas, Kaur, Simranjit

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies

- Boland, Natashia, Kalinowski, Thomas, Kaur, Simranjit

The network maintenance problem

- Charkhgard, Parisa, Kalinowski, Thomas, Waterer, Hamish

A lower bound on the zero forcing number

- Davila, Randy, Kalinowski, Thomas, Stephen, Sudeep

Incremental network design with minimum spanning trees

- Engel, Konrad, Kalinowski, Thomas, Savelsbergh, Martin W. P.

Hamiltonian cycles and subsets of discounted occupational measures

- Eshragh, Ali, Filar, Jerzy A., Kalinowski, Thomas, Mohammadian, Sogol

Maintenance scheduling in a railway corridor

- Eskandarzadeh, Saman, Kalinowski, Thomas, Waterer, Hamish

Zero forcing in iterated line digraphs

- Ferrero, Daniela, Kalinowski, Thomas, Stephen, Sudeep

Minimum rank and zero forcing number for butterfly networks

- Ferrero, Daniela, Grigorious, Cyriac, Kalinowski, Thomas, Ryan, Joe, Stephen, Sudeep

Coalitional manipulation for Schulze's rule

- Gaspers, Serge, Kalinowski, Thomas, Narodytska, Nina, Walsh, Toby