Claudio Telha

According to our database, Claudio Telha authored at least 13 papers between 2011 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2025

Integration of Sales and Operations: A Dynamic Mixed-Integer Programming Game.

Claudio Telha, Margarida Carvalho

Dyn. Games Appl., March, 2025

2024

On the complexity of a maintenance problem for hierarchical systems.

Andreas S. Schulz, Claudio Telha

Oper. Res. Lett., 2024

Integer Factorization: Why Two-Item Joint Replenishment Is Hard.

Andreas S. Schulz, Claudio Telha

Oper. Res., 2024

2022

A sequential Stackelberg game for dynamic inspection problems.

Cristóbal Guzmán, Javiera Riffo, Claudio Telha, Mathieu Van Vyve

Eur. J. Oper. Res., 2022

2021

Optimal bundle composition in competition for continuous attributes.

Kenneth Page, Juan Pérez, Claudio Telha, Andrés García-Echalar, Héctor A. López-Ospina

Eur. J. Oper. Res., 2021

Independent Sets and Hitting Sets of Bicolored Rectangular Families.

José A. Soto, Claudio Telha

Algorithmica, 2021

2020

Integer factorization and Riemann's hypothesis: Why two-item joint replenishment is hard.

Andreas S. Schulz, Claudio Telha

CoRR, 2020

2018

On the on-line maintenance scheduling problem.

Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve

Optim. Lett., 2018

2016

Efficient approximation schemes for Economic Lot-Sizing in continuous time.

Claudio Telha, Mathieu Van Vyve

Discret. Optim., 2016

2011

On-line approximate string matching with bounded errors.

Marcos A. Kiwi, Gonzalo Navarro, Claudio Telha

Theor. Comput. Sci., 2011

Optimization over Integers with Robustness in Cost and Few Constraints.

Kai-Simon Goetzmann, Sebastian Stiller, Claudio Telha

Proceedings of the Approximation and Online Algorithms - 9th International Workshop, 2011

Jump Number of Two-Directional Orthogonal Ray Graphs.

José A. Soto, Claudio Telha

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands.

Andreas S. Schulz, Claudio Telha

Proceedings of the Algorithms - ESA 2011, 2011