Peter Stuckey

Ballot-Polling Audits of Instant-Runoff Voting Elections with a Dirichlet-Tree Model

Floyd Everest, Michelle Blom, Philip B Stark, Peter J Stuckey, Vanessa Teague, Damjan Vukcevic

Book Chapter  |  2023  |  Lecture Notes in Computer Science

Branch-and-cut-and-price for the Electric Vehicle Routing Problem with Time Windows, Piecewise-Linear Recharging and Capacitated Recharging Stations

Edward Lam, Guy Desaulniers, Peter J Stuckey

Journal article  |  2022  |  Computers & Operations Research

Branch-and-cut-and-price for multi-agent path finding

Edward Lam, Pierre Le Bodic, Daniel Harabor, Peter J Stuckey

Journal article  |  2022  |  Computers & Operations Research

Multi-Train Path Finding Revisited

Zhe Chen, Jiaoyang Li, Daniel Harabor, Peter J Stuckey, Sven Koenig

Journal article  |  2022  |  Proceedings of the International Symposium on Combinatorial Search

Multi-Train Path Finding (MTPF) is a coordination problem that asks us to plan collision-free paths for a team of moving agents, w..

Dual Euclidean Shortest Path Search (Extended Abstract)

Ryan Hechenberger, Peter J Stuckey, Pierre Le Bodic, Daniel D Harabor

Journal article  |  2022  |  Proceedings of the International Symposium on Combinatorial Search

The Euclidean Shortest Path Problem (ESPP) asks us to find a minimum length path between two points on a 2D plane while avoiding a..

A Divide and Conquer Algorithm for Predict Optimize with Non-convex Problems

AU Guler, E Demirović, J Chan, J Bailey, C Leckie, PJ Stuckey

Conference Proceedings  |  2022  |  Proceedings of the 36th AAAI Conference on Artificial Intelligence, AAAI 2022

The predict+optimize problem combines machine learning and combinatorial optimization by predicting the problem coefficients first..

MAPF-LNS2: Fast Repairing for Multi-Agent Path Finding via Large Neighborhood Search

Jiaoyang Li, Zhe Chen, Daniel Harabor, Peter J Stuckey, Sven Koenig

Journal article  |  2022  |  Proceedings of the AAAI Conference on Artificial Intelligence

Multi-Agent Path Finding (MAPF) is the problem of planning collision-free paths for multiple agents in a shared environment. In th..

Flex Distribution for Bounded-Suboptimal Multi-Agent Path Finding

Shao-Hung Chan, Jiaoyang Li, Graeme Gange, Daniel Harabor, Peter J Stuckey, Sven Koenig

Journal article  |  2022  |  Proceedings of the AAAI Conference on Artificial Intelligence

Multi-Agent Path Finding (MAPF) is the problem of finding collision-free paths for multiple agents that minimize the sum of path c..

Using MaxSAT for Efficient Explanations of Tree Ensembles

Alexey Ignatiev, Yacine Izza, Peter J Stuckey, Joao Marques-Silva

Journal article  |  2022  |  Proceedings of the AAAI Conference on Artificial Intelligence

Tree ensembles (TEs) denote a prevalent machine learning model that do not offer guarantees of interpretability, that represent a ..

On the reliability and the limits of inference of amino acid sequence alignments.

Sandun Rajapaksa, Dinithi Sumanaweera, Arthur M Lesk, Lloyd Allison, Peter J Stuckey, Maria Garcia de la Banda, David Abramson, Arun S Konagurthu

Journal article  |  2022  |  Bioinformatics

MOTIVATION: Alignments are correspondences between sequences. How reliable are alignments of amino acid sequences of proteins, and..