![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Christian Tjandraatmadja
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c7]Theodore P. Papalexopoulos, Christian Tjandraatmadja, Ross Anderson, Juan Pablo Vielma, David Belanger:
Constrained Discrete Black-Box Optimization using Mixed-Integer Programming. ICML 2022: 17295-17322 - 2021
- [j6]Christian Tjandraatmadja, Willem-Jan van Hoeve:
Incorporating bounds from decision diagrams into integer programming. Math. Program. Comput. 13(2): 225-256 (2021) - 2020
- [j5]Ross Anderson, Joey Huchette
, Will Ma
, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1): 3-39 (2020) - [c6]Moonkyung Ryu, Yinlam Chow, Ross Anderson, Christian Tjandraatmadja, Craig Boutilier:
CAQL: Continuous Action Q-Learning. ICLR 2020 - [c5]Arthur Delarue, Ross Anderson, Christian Tjandraatmadja:
Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing. NeurIPS 2020 - [c4]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. NeurIPS 2020 - [i7]Christian Tjandraatmadja, Ross Anderson, Joey Huchette, Will Ma, Krunal Patel, Juan Pablo Vielma:
The Convex Relaxation Barrier, Revisited: Tightened Single-Neuron Relaxations for Neural Network Verification. CoRR abs/2006.14076 (2020) - [i6]Arthur Delarue, Ross Anderson, Christian Tjandraatmadja:
Reinforcement Learning with Combinatorial Actions: An Application to Vehicle Routing. CoRR abs/2010.12001 (2020) - [i5]Vinod Nair, Sergey Bartunov, Felix Gimeno
, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O'Donoghue, Nicolas Sonnerat, Christian Tjandraatmadja, Pengming Wang, Ravichandra Addanki, Tharindi Hapuarachchi, Thomas Keck, James Keeling, Pushmeet Kohli, Ira Ktena, Yujia Li, Oriol Vinyals, Yori Zwols:
Solving Mixed Integer Programs Using Neural Networks. CoRR abs/2012.13349 (2020)
2010 – 2019
- 2019
- [j4]Christian Tjandraatmadja
, Willem-Jan van Hoeve
:
Target Cuts from Relaxed Decision Diagrams. INFORMS J. Comput. 31(2): 285-301 (2019) - [c3]Ross Anderson, Joey Huchette
, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong Mixed-Integer Programming Formulations for Trained Neural Networks. IPCO 2019: 27-42 - [i4]Moonkyung Ryu, Yinlam Chow, Ross Anderson, Christian Tjandraatmadja, Craig Boutilier:
CAQL: Continuous Action Q-Learning. CoRR abs/1909.12397 (2019) - 2018
- [c2]Thiago Serra, Christian Tjandraatmadja, Srikumar Ramalingam:
Bounding and Counting Linear Regions of Deep Neural Networks. ICML 2018: 4565-4573 - [i3]Thiago Serra, Christian Tjandraatmadja, Srikumar Ramalingam:
How Could Polyhedral Theory Harness Deep Learning? CoRR abs/1806.06365 (2018) - [i2]Ross Anderson, Joey Huchette, Christian Tjandraatmadja, Juan Pablo Vielma:
Strong mixed-integer programming formulations for trained neural networks. CoRR abs/1811.08359 (2018) - 2017
- [i1]Thiago Serra, Christian Tjandraatmadja, Srikumar Ramalingam:
Bounding and Counting Linear Regions of Deep Neural Networks. CoRR abs/1711.02114 (2017) - 2010
- [j3]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes
, Carlos Eduardo Ferreira
, Fábio Viduani Martinez
, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
:
Repetition-free longest common subsequence. Discret. Appl. Math. 158(12): 1315-1324 (2010) - [j2]Carlos Eduardo Ferreira, Christian Tjandraatmadja:
A branch-and-cut approach to the repetition-free longest common subsequence problem. Electron. Notes Discret. Math. 36: 527-534 (2010)
2000 – 2009
- 2008
- [j1]Said Sadique Adi, Marília D. V. Braga, Cristina G. Fernandes, Carlos Eduardo Ferreira, Fábio Viduani Martinez, Marie-France Sagot, Marco Aurelio Stefanes, Christian Tjandraatmadja, Yoshiko Wakabayashi
:
Repetition-free longest common subsequence. Electron. Notes Discret. Math. 30: 243-248 (2008) - [c1]Cristina G. Fernandes
, Carlos Eduardo Ferreira
, Christian Tjandraatmadja, Yoshiko Wakabayashi
:
A Polyhedral Investigation of the LCS Problem and a Repetition-Free Variant. LATIN 2008: 329-338
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint