Follow
Johannes Hatzl
Johannes Hatzl
Universitaetsdozent, Graz University of Technology
Verified email at opt.math.tugraz.at
Title
Cited by
Cited by
Year
Review, extensions and computational comparison of MILP formulations for scheduling of batch processes
RE Burkard, J Hatzl
Computers & Chemical Engineering 29 (8), 1752-1769, 2005
732005
Reverse 2-median problem on trees
RE Burkard, E Gassner, J Hatzl
Discrete Applied Mathematics 156 (11), 1963-1976, 2008
382008
A linear time algorithm for the reverse 1‐median problem on a cycle
RE Burkard, E Gassner, J Hatzl
Networks: An International Journal 48 (1), 16-23, 2006
362006
Median problems on wheels and cactus graphs
J Hatzl
Computing 80 (4), 377-393, 2007
212007
A complex time based construction heuristic for batch scheduling problems in the chemical industry
RE Burkard, J Hatzl
European Journal of Operational Research 174 (2), 1162-1183, 2006
202006
Median problems with positive and negative weights on cycles and cacti
RE Burkard, J Hatzl
Journal of combinatorial optimization 20 (1), 27-46, 2010
142010
2-Balanced flows and the inverse 1-median problem in the Chebyshev space
J Hatzl
Discrete optimization 9 (3), 137-148, 2012
122012
A Parity Domination Problem in Graphs with Bounded Treewidth and Distance-hereditary Graphs
E Gassner, J Hatzl
82008
How hard is it to find extreme Nash equilibria in network congestion games?
E Gassner, J Hatzl, SO Krumke, H Sperber, GJ Woeginger
Theoretical Computer Science 410 (47-49), 4989-4999, 2009
72009
The 1-median problem in Rd with the Chebyshev-norm and its inverse problem
J Hatzl
Electronic Notes in Discrete Mathematics 36, 1137-1144, 2010
52010
Combinatorial properties of a general domination problem with parity constraints
J Hatzl, S Wagner
Discrete mathematics 308 (24), 6355-6367, 2008
42008
Makespan minimization for batch processes
J Hatzl
na, 2004
32004
A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm
J Hatzl, A Karrenbauer
Operations research letters 38 (5), 383-385, 2010
22010
How hard is it to find extreme Nash equilibria in network congestion games?
E Gassner, J Hatzl, SO Krumke, H Sperber, GJ Woeginger
Internet and Network Economics: 4th International Workshop, WINE 2008 …, 2008
22008
clever or smart: Strategies for the online target date assignment problem
E Gassner, J Hatzl, SO Krumke, S Saliba
Discrete applied mathematics 158 (1), 71-79, 2010
12010
Mixed-integer linear programs for batch processes
RE Burkard, J Hatzl
Discrete optimization methods in production and logistics (DOM'2004), 108-113, 2004
12004
Maximizing a Sum Related to Image Segmentation Evaluation
J Hatzl, T Mansour, M Shattuck
Journal of Mathematical Modelling and Algorithms 10 (2), 193-203, 2011
2011
New Efficient Algorithms in Location Theory
J Hatzl
2011
The 1-Median Problem in Formula Not Shown with the Chebyshev-Norm and its Inverse Problem
J Hatzl
ELECTRONIC NOTES IN DISCRETE MATHEMATICS 36 (1), 1137-1144, 2010
2010
The Inverse 1-Median Problem in Rd with the Chebyshev-Norm⋆
J Hatzl
9th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 87-90, 2010
2010
The system can't perform the operation now. Try again later.
Articles 1–20