default search action
André Augusto Ciré
Person information
- affiliation: University of Toronto Scarborough, Canada
- affiliation (former): Carnegie Mellon University
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j26]Amin Hosseininasab, Willem-Jan van Hoeve, André A. Ciré:
Memory-Efficient Sequential Pattern Mining with Hybrid Tries. J. Mach. Learn. Res. 25: 227:1-227:29 (2024) - 2023
- [j25]Merve Bodur
, Mucahit Cevik
Multistage stochastic fractionated intensity modulated radiation therapy planning. Comput. Oper. Res. 160: 106371 (2023) - [j24]Ningyuan Chen
Model-Free Assortment Pricing with Transaction Data. Manag. Sci. 69(10): 5830-5847 (2023) - [e1]André A. Ciré
Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 20th International Conference, CPAIOR 2023, Nice, France, May 29 - June 1, 2023, Proceedings. Lecture Notes in Computer Science 13884, Springer 2023, ISBN 978-3-031-33270-8 [contents] - 2022
- [j23]Jaime E. González
BDD-based optimization for the quadratic stable set problem. Discret. Optim. 44(Part): 100610 (2022) - [j22]David Bergman
Network Models for Multiobjective Discrete Optimization. INFORMS J. Comput. 34(2): 990-1005 (2022) - [j21]Margarita P. Castro
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances. INFORMS J. Comput. 34(4): 2271-2295 (2022) - [j20]Margarita P. Castro
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming. Math. Program. 196(1): 115-171 (2022) - [i8]Amin Hosseininasab, Willem-Jan van Hoeve, André A. Ciré:
Memory Efficient Tries for Sequential Pattern Mining. CoRR abs/2202.06834 (2022) - [i7]Leonardo Lozano, David Bergman, André A. Ciré:
Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization. CoRR abs/2206.12962 (2022) - 2021
- [c30]Quentin Cappart, Thierry Moisan, Louis-Martin Rousseau, Isabeau Prémont-Schwarz
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization. AAAI 2021: 3677-3687 - [c29]Allan Sapucaia, André A. Ciré, Pedro J. de Rezende, Cid C. de Souza:
Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips. CCCG 2021: 185-194 - [c28]Xavier Gillard
Improving the Filtering of Branch-and-Bound MDD Solver. CPAIOR 2021: 231-247 - [c27]Carlos Eduardo de Andrade
Minimizing Effort and Risk with Network Change Deployment Planning. Networking 2021: 1-9 - [i6]Xavier Gillard, Vianney Coppé, Pierre Schaus, André Augusto Ciré:
Improving the filtering of Branch-And-Bound MDD solver (extended). CoRR abs/2104.11951 (2021) - [i5]Carlos Henrique Cardonha, André Augusto Ciré, Lucas Correia Villa Real:
On Exact and Approximate Policies for Linear Tape Scheduling in Data Centers. CoRR abs/2112.07018 (2021) - 2020
- [j19]Jaime E. González
Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem. Constraints An Int. J. 25(1-2): 23-46 (2020) - [j18]Margarita P. Castro
An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP. INFORMS J. Comput. 32(2): 263-278 (2020) - [j17]Selvaprabu Nadarajah
Network-Based Approximate Linear Programming for Discrete Optimization. Oper. Res. 68(6): 1767-1786 (2020) - [j16]Margarita P. Castro
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics. J. Artif. Intell. Res. 67: 607-651 (2020) - [i4]Quentin Cappart, Thierry Moisan, Louis-Martin Rousseau, Isabeau Prémont-Schwarz, André Augusto Ciré:
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization. CoRR abs/2006.01610 (2020)
2010 – 2019
- 2019
- [j15]David Bergman
On the Minimum Chordal Completion Polytope. Oper. Res. 67(2): 532-547 (2019) - [c26]Amin Hosseininasab, Willem-Jan van Hoeve, André A. Ciré:
Constraint-Based Sequential Pattern Mining with Decision Diagrams. AAAI 2019: 1495-1502 - [c25]Margarita P. Castro, Chiara Piacentini, André A. Ciré, J. Christopher Beck:
Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation. ICAPS 2019: 77-85 - [c24]Rodrigo Toro Icarte, León Illanes, Margarita P. Castro
Training Binarized Neural Networks Using MIP and CP. CP 2019: 401-417 - 2018
- [j14]David Bergman
Discrete Nonlinear Optimization by State-Space Decompositions. Manag. Sci. 64(10): 4700-4720 (2018) - [c23]Chiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning. AAAI 2018: 6254-6261 - [c22]Chiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Compiling Optimal Numeric Planning to Mixed Integer Linear Programming. ICAPS 2018: 383-387 - [c21]Michael Römer
A Local Search Framework for Compiling Relaxed Decision Diagrams. CPAIOR 2018: 512-520 - [i3]David Bergman, Merve Bodur, Carlos Cardonha, André A. Ciré:
Network Models for Multiobjective Discrete Optimization. CoRR abs/1802.08637 (2018) - [i2]Amin Hosseininasab, Willem-Jan van Hoeve, André Augusto Ciré:
Constraint-based Sequential Pattern Mining with Decision Diagrams. CoRR abs/1811.06086 (2018) - 2017
- [j13]Joris Kinable
Hybrid optimization methods for time-dependent sequencing problems. Eur. J. Oper. Res. 259(3): 887-897 (2017) - [c20]David Bergman, André Augusto Ciré:
On Finding the Optimal BDD Relaxation. CPAIOR 2017: 41-50 - [c19]Omid Sanei Bajgiran, André A. Ciré, Louis-Martin Rousseau:
A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing. CPAIOR 2017: 221-228 - 2016
- [b1]David Bergman, André A. Ciré, Willem-Jan van Hoeve, John N. Hooker:
Decision Diagrams for Optimization. Artificial Intelligence: Foundations, Theory, and Algorithms, Springer 2016, ISBN 978-3-319-42847-5, pp. 1-234 - [j12]David Bergman, André Augusto Ciré:
Theoretical insights and algorithmic tools for decision diagram-based optimization. Constraints An Int. J. 21(4): 533-556 (2016) - [j11]André Augusto Ciré, John N. Hooker, Tallys H. Yunes:
Modeling with Metaconstraints and Semantic Typing of Variables. INFORMS J. Comput. 28(1): 1-13 (2016) - [j10]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve, John N. Hooker:
Discrete Optimization with Decision Diagrams. INFORMS J. Comput. 28(1): 47-66 (2016) - [j9]André Augusto Ciré, Elvin Coban
Logic-based Benders decomposition for planning and scheduling: a computational analysis. Knowl. Eng. Rev. 31(5): 440-451 (2016) - [c18]David Bergman, André Augusto Ciré:
Multiobjective Optimization by Decision Diagrams. CP 2016: 86-95 - [c17]David Bergman, André A. Ciré:
Decomposition Based on Decision Diagrams. CPAIOR 2016: 45-54 - [c16]Buser Say, André A. Ciré, J. Christopher Beck:
Mathematical Programming Models for Optimizing Partial-Order Plan Flexibility. ECAI 2016: 1044-1052 - [c15]André A. Ciré:
Hybrid Approaches Based on Lagrangian Relaxation. ISAIM 2016 - [i1]David Bergman, Carlos Henrique Cardonha, André Augusto Ciré, Arvind U. Raghunathan:
On the Minimum Chordal Completion Polytope. CoRR abs/1612.01966 (2016) - 2015
- [j8]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve:
Lagrangian bounds from decision diagrams. Constraints An Int. J. 20(3): 346-361 (2015) - [j7]André Augusto Ciré:
Decision diagrams for optimization. Constraints An Int. J. 20(4): 494-495 (2015) - [c14]David Bergman, André Augusto Ciré, Willem-Jan van Hoeve:
Improved Constraint Propagation via Lagrangian Decomposition. CP 2015: 30-38 - 2014
- [j6]David Bergman, André A. Ciré, Willem Jan van Hoeve, Tallys H. Yunes:
BDD-based heuristics for binary optimization. J. Heuristics 20(2): 211-234 (2014) - [j5]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams. INFORMS J. Comput. 26(2): 253-268 (2014) - [j4]David Bergman, André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Sequence Constraints. J. Artif. Intell. Res. 50: 697-722 (2014) - [c13]André A. Ciré, Serdar Kadioglu, Meinolf Sellmann:
Parallel Restarted Search. AAAI 2014: 842-848 - [c12]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Optimization Bounds from Binary Decision Diagrams - (Extended Abstract). CP 2014: 903-907 - [c11]André A. Ciré, Willem-Jan van Hoeve:
Multivalued Decision Diagrams for Sequencing Problems - (Extended Abstract). CP 2014: 918-922 - [c10]David Bergman, André A. Ciré, Ashish Sabharwal, Horst Samulowitz, Vijay A. Saraswat, Willem Jan van Hoeve:
Parallel Combinatorial Optimization with Decision Diagrams. CPAIOR 2014: 351-367 - [c9]André A. Ciré, John N. Hooker:
The Separation Problem for Binary Decision Diagrams. ISAIM 2014 - 2013
- [j3]André A. Ciré, Willem Jan van Hoeve:
Multivalued Decision Diagrams for Sequencing Problems. Oper. Res. 61(6): 1411-1428 (2013) - [c8]André A. Ciré, Elvin Coban
Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling. CPAIOR 2013: 325-331 - 2012
- [j2]Tony Minoru Tamura Lopes, Arnaldo Vieira Moura, Cid C. de Souza
Planning the operation of a large real-world oil pipeline. Comput. Chem. Eng. 46: 17-28 (2012) - [c7]André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Disjunctive Scheduling. ICAPS 2012 - [c6]David Bergman, André A. Ciré, Willem Jan van Hoeve, John N. Hooker:
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem. CPAIOR 2012: 34-49 - [c5]André A. Ciré, Elvin Coban, Willem Jan van Hoeve:
Flow-Based Combinatorial Chance Constraints. CPAIOR 2012: 129-145 - 2010
- [j1]Tony Minoru Tamura Lopes, André A. Ciré, Cid Carvalho de Souza
A hybrid model for a multiproduct pipeline planning and scheduling problem. Constraints An Int. J. 15(2): 151-189 (2010)
2000 – 2009
- 2009
- [c4]Adi Botea, André A. Ciré:
Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events. IJCAI 2009: 1647-1652 - 2008
- [c3]Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes:
Planning and Scheduling the Operation of a Very Large Oil Pipeline Network. CP 2008: 36-51 - [c2]Arnaldo Vieira Moura, Cid C. de Souza, André A. Ciré, Tony Minoru Tamura Lopes:
Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem. CSE 2008: 455-462 - [c1]André A. Ciré, Adi Botea:
Learning in Planning with Temporally Extended Goals and Uncontrollable Events. ECAI 2008: 578-582
Coauthor Index
aka: Willem-Jan van Hoeve
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-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: