Følg
Thomas Kalinowski
Tittel
Sitert av
Sitert av
År
Incremental network design with maximum flows
T Kalinowski, D Matsypura, MWP Savelsbergh
European Journal of Operational Research 242 (1), 51-62, 2014
772014
Incremental network design with shortest paths
M Baxter, T Elgindy, AT Ernst, T Kalinowski, MWP Savelsbergh
European Journal of Operational Research 238 (3), 675-684, 2014
762014
Cooperation in the Minority Game with local information
T Kalinowski, HJ Schulz, M Briese
Physica A: Statistical Mechanics and its Applications 277 (3-4), 502-508, 2000
712000
A social welfare optimal sequential allocation procedure
T Kalinowski, N Nardoytska, T Walsh
23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), 2013
642013
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
T Kalinowski
Discrete Applied Mathematics 152 (1), 52-88, 2005
61*2005
Strategic Behavior when Allocating Indivisible Goods Sequentially
T Kalinowski, N Narodytska, T Walsh, L Xia
27th Conference on Artificial Intelligence (AAAI 2013), 2013
572013
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain
N Boland, T Kalinowski, H Waterer, L Zheng
Journal of Scheduling 16 (6), 649-659, 2013
562013
Scheduling arc maintenance jobs in a network to maximize total flow over time
N Boland, T Kalinowski, H Waterer, L Zheng
Discrete Applied Mathematics 163, 34-52, 2014
502014
The zero forcing number of graphs
T Kalinowski, N Kamčev, B Sudakov
SIAM Journal on Discrete Mathematics 33 (1), 95-115, 2019
452019
A lower bound on the zero forcing number
R Davila, T Kalinowski, S Stephen
Discrete Applied Mathematics 250, 363-367, 2018
452018
Resource considerations for integrated planning of railway traffic and maintenance windows
T Lidén, T Kalinowski, H Waterer
Journal of Rail Transport Planning & Management 8 (1), 1-15, 2018
432018
A reclaimer scheduling problem arising in coal stockyard management
E Angelelli, T Kalinowski, R Kapoor, MWP Savelsbergh
Journal of Scheduling 19 (5), 563-582, 2015
432015
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence
T Kalinowski
Discrete Applied Mathematics 157 (9), 2089-2104, 2009
40*2009
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
N Boland, SS Dey, T Kalinowski, M Molinaro, F Rigterink
Mathematical Programming 162 (1), 523-535, 2017
392017
Realization of intensity modulated radiation fields using multileaf collimators
T Kalinowski
General Theory of Information Transfer and Combinatorics, 1010-1055, 2006
342006
New multi-commodity flow formulations for the pooling problem
N Boland, T Kalinowski, F Rigterink
Journal of Global Optimization 66 (4), 669-710, 2016
332016
Incremental network design with minimum spanning trees
K Engel, T Kalinowski, MWP Savelsbergh
Journal of Graph Algorithms and Applications 21 (4), 417-432, 2017
31*2017
Scheduling reclaimers serving a stock pad at a coal terminal
T Kalinowski, R Kapoor, MWP Savelsbergh
Journal of Scheduling 20 (1), 85-101, 2017
252017
Minimum Cardinality Non-Anticipativity Constraint Sets for Multistage Stochastic Programming with Endogeneous Observation of Uncertainty
N Boland, I Dumitrescu, G Froyland, T Kalinowski
Mathematical Programming B 157 (1), 69-93, 2016
232016
Extended formulations for convex hulls of graphs of bilinear functions
A Gupte, T Kalinowski, F Rigterink, H Waterer
Discrete Optimization, 100569, 2020
222020
Systemet kan ikke utføre handlingen. Prøv på nytt senere.
Artikler 1–20