Christian Tjandraatmadja

Orcid: 0000-0002-0881-3511

According to our database1, Christian Tjandraatmadja authored at least 14 papers between 2008 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
Constrained Discrete Black-Box Optimization using Mixed-Integer Programming.
Proceedings of the International Conference on Machine Learning, 2022

2021
Incorporating bounds from decision diagrams into integer programming.
Math. Program. Comput., 2021

2020
Strong mixed-integer programming formulations for trained neural networks.
Math. Program., 2020

Solving Mixed Integer Programs Using Neural Networks.
CoRR, 2020

The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

CAQL: Continuous Action Q-Learning.
Proceedings of the 8th International Conference on Learning Representations, 2020

2019
Target Cuts from Relaxed Decision Diagrams.
INFORMS J. Comput., 2019

Strong Mixed-Integer Programming Formulations for Trained Neural Networks.
Proceedings of the Integer Programming and Combinatorial Optimization, 2019

2018
How Could Polyhedral Theory Harness Deep Learning?
CoRR, 2018

Bounding and Counting Linear Regions of Deep Neural Networks.
Proceedings of the 35th International Conference on Machine Learning, 2018

2010
A branch-and-cut approach to the repetition-free longest common subsequence problem.
Electron. Notes Discret. Math., 2010

2008
Repetition-free longest common subsequence.
Electron. Notes Discret. Math., 2008

A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008


  Loading...