Az adott oktató valamelyik doktori iskolában kiírt doktoranduszok számára kutatási témát, amire most jelentkezni is lehet, de még nincsen témavezetett doktorandusza.
research field in which current research is conducted
mathematics and computing
Publications
2019
from data base, 2020. IV. 05.
Györgyi P, Kis T: A probabilistic approach to pickup and delivery problems with time window uncertainty, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 274: (3) pp. 909-923. type of document: Journal paper/Article number of independent citations: 3 language: English URL
2018
from data base, 2020. IV. 05.
Györgyi P, Kis T: Minimizing the maximum lateness on a single machine with raw material constraints by branch-and-cut, COMPUTERS AND INDUSTRIAL ENGINEERING 115: pp. 220-225. type of document: Journal paper/Article number of independent citations: 3 language: English URL
2017
from data base, 2020. IV. 05.
Györgyi P, Kis T: Approximation schemes for parallel machine scheduling with non-renewable resources, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 258: (1) pp. 113-123. type of document: Journal paper/Article number of independent citations: 11 language: English URL
2016
from data base, 2020. IV. 05.
Balas E, Kis T: On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, MATHEMATICAL PROGRAMMING 160: pp. 85-114. type of document: Journal paper/Article number of independent citations: 2 language: English URL
2016
from data base, 2020. IV. 05.
Horváth M, Kis T: Solving resource constrained shortest path problems with LP-based methods, COMPUTERS & OPERATIONS RESEARCH 73: pp. 150-164. type of document: Journal paper/Article number of independent citations: 8 language: English URL
2012
from data base, 2020. IV. 05.
Kis T, Kovács A: A cutting plane approach for integrated planning and scheduling, COMPUTERS & OPERATIONS RESEARCH 39: (2) pp. 320-327. type of document: Journal paper/Article number of independent citations: 21 language: English URL
2009
from data base, 2020. IV. 05.
Drótos M, Erdős F, Kis T: Computing lower and upper bounds for a large-scale industrial job shop scheduling problem, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 197: (1) pp. 296-306. type of document: Journal paper/Article number of independent citations: 20 language: English URL
2005
from data base, 2020. IV. 05.
Kis T: A branch-and-cut algorithm for scheduling of projects with variable-intensity activities, MATHEMATICAL PROGRAMMING 103: (3) pp. 515-539. type of document: Journal paper/Article number of independent citations: 67 language: English URL
2004
from data base, 2020. IV. 05.
Kis T: On the complexity of the car sequencing problem, OPERATIONS RESEARCH LETTERS 32: pp. 331-335. type of document: Journal paper/Article number of independent citations: 73 language: English URL
2003
from data base, 2020. IV. 05.
Kis T: Job-shop scheduling with processing alternatives, EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 151: (2) pp. 307-332. type of document: Journal paper/Article number of independent citations: 54 language: English URL
Number of independent citations to these publications:
number of independent citations to scientific publications and creative works:
The number of citations displayed after clicking on the link may differ from the displayed number because the former displays the current state of MTMT2 and the latter was the case when importing science metrics.