Articoli con mandati relativi all'accesso pubblico - T'kindtUlteriori informazioni
Non disponibile pubblicamente: 1
Single machine rescheduling for new orders with maximum lateness minimization
E Rener, F Salassa, V T’kindt
Computers & Operations Research 144, 105815, 2022
Mandati: Governo Italiano
Disponibili pubblicamente: 7
3D numerical modeling of the propagation of hydraulic fracture at its intersection with natural (pre-existing) fracture
AN Dehghan, K Goshtasbi, K Ahangari, Y Jin, A Bahmani
Rock Mechanics and Rock Engineering 50, 367-386, 2017
Mandati: National Natural Science Foundation of China
Exponential time algorithms for just-in-time scheduling problems with common due date and symmetric weights
V T’kindt, L Shang, F Della Croce
Journal of Combinatorial Optimization 39 (3), 764-775, 2020
Mandati: Governo Italiano
Branch & Memorize exact algorithms for sequencing problems: Efficient embedding of memorization into search trees
L Shang, V t’Kindt, F Della Croce
Computers & Operations Research 128, 105171, 2021
Mandati: Governo Italiano
Parallel machine scheduling with minimum number of tardy jobs: Approximation and exponential algorithms
F Della Croce, V T’kindt, O Ploton
Applied Mathematics and Computation 397, 125888, 2021
Mandati: Governo Italiano
A tight linear time -approximation algorithm for the problem
F Della Croce, R Scatamacchia, V T’kindt
Journal of Combinatorial Optimization 38, 608-617, 2019
Mandati: Governo Italiano
Solving a time-indexed formulation for an unrelated parallel machine scheduling problem by preprocessing and cutting planes
L Berghman, FCR Spieksma, V T’kindt
RAIRO-Operations Research 55, S1747-S1765, 2021
Mandati: Research Foundation (Flanders), Belgian Science Policy Office
Solving a time-indexed formulation by preprocessing and cutting planes
L Berghman, F Spieksma, V t'Kindt
Available at SSRN 2437371, 2014
Mandati: Research Foundation (Flanders)
Le informazioni sulla pubblicazione e sul finanziamento vengono stabilite automaticamente da un software