André Augusto Ciré

Orcid: 0000-0001-5993-4295

Affiliations:
  • University of Toronto Scarborough, Canada
  • Carnegie Mellon University (former)


According to our database1, André Augusto Ciré authored at least 60 papers between 2008 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multistage stochastic fractionated intensity modulated radiation therapy planning.
Comput. Oper. Res., December, 2023

Model-Free Assortment Pricing with Transaction Data.
Manag. Sci., October, 2023

2022
A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming.
Math. Program., 2022

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances.
INFORMS J. Comput., 2022

Network Models for Multiobjective Discrete Optimization.
INFORMS J. Comput., 2022

BDD-based optimization for the quadratic stable set problem.
Discret. Optim., 2022

Constrained Shortest-Path Reformulations for Discrete Bilevel and Robust Optimization.
CoRR, 2022

Memory Efficient Tries for Sequential Pattern Mining.
CoRR, 2022

2021
On Exact and Approximate Policies for Linear Tape Scheduling in Data Centers.
CoRR, 2021

Improving the filtering of Branch-And-Bound MDD solver (extended).
CoRR, 2021

Minimizing Effort and Risk with Network Change Deployment Planning.
Proceedings of the IFIP Networking Conference, 2021

Improving the Filtering of Branch-and-Bound MDD Solver.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

Convex Bichromatic Quadrangulation of Point Sets with Minimum Color Flips.
Proceedings of the 33rd Canadian Conference on Computational Geometry, 2021

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Solving Delete Free Planning with Relaxed Decision Diagram Based Heuristics.
J. Artif. Intell. Res., 2020

Network-Based Approximate Linear Programming for Discrete Optimization.
Oper. Res., 2020

An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP.
INFORMS J. Comput., 2020

Integrated integer programming and decision diagram search tree with an application to the maximum independent set problem.
Constraints An Int. J., 2020

2019
On the Minimum Chordal Completion Polytope.
Oper. Res., 2019

Training Binarized Neural Networks Using MIP and CP.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Relaxed BDDs: An Admissible Heuristic for Delete-Free Planning Based on a Discrete Relaxation.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Constraint-Based Sequential Pattern Mining with Decision Diagrams.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Discrete Nonlinear Optimization by State-Space Decompositions.
Manag. Sci., 2018

A Local Search Framework for Compiling Relaxed Decision Diagrams.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

Compiling Optimal Numeric Planning to Mixed Integer Linear Programming.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

Linear and Integer Programming-Based Heuristics for Cost-Optimal Numeric Planning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Hybrid optimization methods for time-dependent sequencing problems.
Eur. J. Oper. Res., 2017

On Finding the Optimal BDD Relaxation.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

A First Look at Picking Dual Variables for Maximizing Reduced Cost Fixing.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Decision Diagrams for Optimization
Artificial Intelligence: Foundations, Theory, and Algorithms, Springer, ISBN: 978-3-319-42849-9, 2016

Logic-based Benders decomposition for planning and scheduling: a computational analysis.
Knowl. Eng. Rev., 2016

Modeling with Metaconstraints and Semantic Typing of Variables.
INFORMS J. Comput., 2016

Discrete Optimization with Decision Diagrams.
INFORMS J. Comput., 2016

Theoretical insights and algorithmic tools for decision diagram-based optimization.
Constraints An Int. J., 2016

Hybrid Approaches Based on Lagrangian Relaxation.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2016

Mathematical Programming Models for Optimizing Partial-Order Plan Flexibility.
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

Decomposition Based on Decision Diagrams.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

Multiobjective Optimization by Decision Diagrams.
Proceedings of the Principles and Practice of Constraint Programming, 2016

2015
Decision diagrams for optimization.
Constraints An Int. J., 2015

Lagrangian bounds from decision diagrams.
Constraints An Int. J., 2015

Improved Constraint Propagation via Lagrangian Decomposition.
Proceedings of the Principles and Practice of Constraint Programming, 2015

2014
MDD Propagation for Sequence Constraints.
J. Artif. Intell. Res., 2014

Optimization Bounds from Binary Decision Diagrams.
INFORMS J. Comput., 2014

BDD-based heuristics for binary optimization.
J. Heuristics, 2014

The Separation Problem for Binary Decision Diagrams.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2014

Parallel Combinatorial Optimization with Decision Diagrams.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2014

Multivalued Decision Diagrams for Sequencing Problems - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

Optimization Bounds from Binary Decision Diagrams - (Extended Abstract).
Proceedings of the Principles and Practice of Constraint Programming, 2014

Parallel Restarted Search.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Multivalued Decision Diagrams for Sequencing Problems.
Oper. Res., 2013

Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2013

2012
Planning the operation of a large real-world oil pipeline.
Comput. Chem. Eng., 2012

Flow-Based Combinatorial Chance Constraints.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

MDD Propagation for Disjunctive Scheduling.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2010
A hybrid model for a multiproduct pipeline planning and scheduling problem.
Constraints An Int. J., 2010

2009
Incremental Heuristic Search for Planning with Temporally Extended Goals and Uncontrollable Events.
Proceedings of the IJCAI 2009, 2009

2008
Learning in Planning with Temporally Extended Goals and Uncontrollable Events.
Proceedings of the ECAI 2008, 2008

Heuristics and Constraint Programming Hybridizations for a Real Pipeline Planning and Scheduling Problem.
Proceedings of the 11th IEEE International Conference on Computational Science and Engineering, 2008

Planning and Scheduling the Operation of a Very Large Oil Pipeline Network.
Proceedings of the Principles and Practice of Constraint Programming, 2008


  Loading...