7 citations · 7 across the 5 of their papers we have counts for
6 papers
Lower Bound of 22 for 3x3 Matrix Multiplication over the Integers
Isaac Rudich, Louis-Martin Rousseau
Strassen showed that two 2x2 matrices can be multiplied with 7 multiplications instead of 8. Applied recursively, his algorithm multiplies two nxn matrices with O(n^2.807) multipli…
Implicit Decision Diagrams
Isaac Rudich, Louis-Martin Rousseau
Decision Diagrams (DDs) have emerged as a powerful tool for discrete optimization, with rapidly growing adoption. DDs are directed acyclic layered graphs; restricted DDs are a gene…
Simple Stochastic Stopping Games: A Generator and Benchmark Library
Avi Rudich, Isaac Rudich, Rachel Rue
Simple Stochastic Games (SSGs) were introduced by Anne Condon in 1990, as the simplest version of Stochastic Games for which there is no known polynomial-time algorithm. Condon sho…
An Exact Framework for Solving the Space-Time Dependent TSP
Isaac Rudich, Quentin Cappart, Manuel López-Ibáñez +2
Many real-world scenarios involve solving bi-level optimization problems in which there is an outer discrete optimization problem, and an inner problem involving expensive or black…
Improved Peel-and-Bound: Methods for Generating Dual Bounds with Multivalued Decision Diagrams
Isaac Rudich, Quentin Cappart, Louis-Martin Rousseau
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still inco…
Peel-and-Bound: Generating Stronger Relaxed Bounds with Multivalued Decision Diagrams
Isaac Rudich, Quentin Cappart, Louis-Martin Rousseau
Decision diagrams are an increasingly important tool in cutting-edge solvers for discrete optimization. However, the field of decision diagrams is relatively new, and is still inco…