Follow
Thomas Kalinowski
Thomas Kalinowski
Hochschule Mittweida
Verified email at hs-mittweida.de - Homepage
Title
Cited by
Cited by
Year
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
682000
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
632014
Incremental network design with maximum flows
T Kalinowski, D Matsypura, MWP Savelsbergh
European Journal of Operational Research 242 (1), 51-62, 2014
572014
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint
T Kalinowski
Discrete Applied Mathematics 152 (1), 52-88, 2005
57*2005
Strategic Behavior when Allocating Indivisible Goods Sequentially
T Kalinowski, N Narodytska, T Walsh, L Xia
27th Conference on Artificial Intelligence (AAAI 2013), 2013
532013
A social welfare optimal sequential allocation procedure
T Kalinowski, N Nardoytska, T Walsh
23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), 2013
482013
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
432013
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
392014
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
37*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
342017
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
262016
Incremental network design with minimum spanning trees
K Engel, T Kalinowski, MWP Savelsbergh
Journal of Graph Algorithms and Applications 21 (4), 417-432, 2017
25*2017
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
232018
The zero forcing number of graphs
T Kalinowski, N Kamčev, B Sudakov
SIAM Journal on Discrete Mathematics 33 (1), 95-115, 2019
212019
A lower bound on the zero forcing number
R Davila, T Kalinowski, S Stephen
Discrete Applied Mathematics 250, 363-367, 2018
21*2018
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
212015
Reducing the number of monitor units in multileaf collimator field segmentation
T Kalinowski
Physics in Medicine & Biology 50 (6), 1147, 2005
182005
Coalitional Manipulation for Schulze’s Rule
S Gaspers, T Kalinowski, N Narodytska, T Walsh
12th International Conference on Autonomous Agents and Multiagent Systems …, 2013
172013
A polynomially solvable case of the pooling problem
N Boland, T Kalinowski, F Rigterink
Journal of Global Optimization, 2016
152016
The system can't perform the operation now. Try again later.
Articles 1–20