6 citations · 17 across the 11 of their papers we have counts for
14 papers
Dual-Based Weight Selection for Approximate Linear Programming
Su Li, Andre A. Cire, Adam Diamant +1
Approximate Linear Programming (ALP) is widely used for large-scale Markov Decision Processes (MDPs), but its performance can be sensitive to the choice of state-relevance weights,…
The Sensitivity of the U.S. Presidential Election to Coordinated Voter Relocation
Carlos Cardonha, David Bergman, Andre Cire +2
U.S. presidential elections are decided by the Electoral College, established in 1789, and designed to mitigate potential risks arising from the collusion of large groups of citize…
Network Relaxations for Discrete Bilevel Optimization under Linear Interactions
Leonardo Lozano, David Bergman, Andre Augusto Cire
We investigate relaxations for a class of discrete bilevel programs where the interaction constraints linking the leader and the follower are linear. Our approach reformulates the…
Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
Leonardo Lozano, David Bergman, Andre A. Cire
Many discrete optimization problems are amenable to constrained shortest-path reformulations in an extended network space, a technique that has been key in convexification, bound s…
Memory-Efficient Sequential Pattern Mining with Hybrid Tries
Amin Hosseininasab, Willem-Jan van Hoeve, Andre A. Cire
This paper develops a memory-efficient approach for Sequential Pattern Mining (SPM), a fundamental topic in knowledge discovery that faces a well-known memory bottleneck for large…
Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
Margarita P. Castro, Andre A. Cire, J. Christopher Beck
In the last decade, decision diagrams (DDs) have been the basis for a large array of novel approaches for modeling and solving optimization problems. Many techniques now use DDs as…