Claudio Telha
Title
Cited by
Cited by
Year
Jump number of two-directional orthogonal ray graphs
JA Soto, C Telha
International Conference on Integer Programming and Combinatorial …, 2011
302011
Optimization over integers with robustness in cost and few constraints
KS Goetzmann, S Stiller, C Telha
International Workshop on Approximation and Online Algorithms, 89-101, 2011
192011
Approximation algorithms and hardness results for the joint replenishment problem with constant demands
AS Schulz, C Telha
European Symposium on Algorithms, 628-639, 2011
162011
Competitive uncapacitated lot-sizing game
M Carvalho, JP Pedroso, C Telha, M Van Vyve
International Journal of Production Economics 204, 148-159, 2018
42018
On-line approximate string matching with bounded errors
M Kiwi, G Navarro, C Telha
Annual Symposium on Combinatorial Pattern Matching, 130-142, 2008
32008
Efficient approximation schemes for Economic Lot-Sizing in continuous time
C Telha, M Van Vyve
Discrete Optimization 20, 23-39, 2016
22016
Independent sets and hitting sets of bicolored rectangular families
JA Soto, C Telha
arXiv preprint arXiv:1411.2311, 2014
22014
On-line approximate string matching with bounded errors
M Kiwi, G Navarro, C Telha
Theoretical Computer Science 412 (45), 6359-6370, 2011
22011
On the on-line maintenance scheduling problem
F Shamsaei, C Telha, M Van Vyve
Optimization Letters 12 (2), 387-397, 2018
12018
Algorithms and hardness results for the jump number problem, the joint replenishment problem, and the optimal clustering of frequency-constrained maintenance jobs
C Telha Cornejo
Massachusetts Institute of Technology, 2012
12012
Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard
AS Schulz, C Telha
arXiv preprint arXiv:2007.09045, 2020
2020
Efficient approximation algorithms for the Economic Lot-Sizing in continuous time.
C Telha, M Van Vyve
CORE Discussion Papers, 2014
2014
The system can't perform the operation now. Try again later.
Articles 1–12