Niche Search: An Evolutionary Algorithm for Global Optimisation. - João Pedro Pedroso (PPSN, 1996)

Optimization on Support Vector Machines. - João Pedro Pedroso; Noboru Murata (IJCNN (6), 2000)

Support vector machines with different norms: motivation, formulations and results. - João Pedro Pedroso; Noboru Murata (Pattern Recognit. Lett., 2001)

Hybrid Tabu Search for Lot Sizing Problems. - João Pedro Pedroso; Mikio Kubo (Hybrid Metaheuristics, 2005)

ODAC: Hierarchical Clustering of Time Series Data Streams. - Pedro Pereira Rodrigues; João Gama 001; João Pedro Pedroso (SDM, 2006)

Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. - João Pedro Pedroso (SLS, 2007)

Simulation-Based Optimization for Steel Stacking. - Rui Jorge Rei; Mikio Kubo; João Pedro Pedroso (MCO, 2008)

Hierarchical Clustering of Time-Series Data Streams. - Pedro Pereira Rodrigues; João Gama 001; João Pedro Pedroso (IEEE Trans. Knowl. Data Eng., 2008)

Metaheuristics for the Asymmetric Hamiltonian Path Problem. - João Pedro Pedroso (NMA, 2010)

Heuristics and exact methods for number partitioning. - João Pedro Pedroso; Mikio Kubo (Eur. J. Oper. Res., 2010)

Certifying Execution Time. - Vítor Rodrigues; João Pedro Pedroso; Mário Florido; Simão Melo de Sousa (FOPARA, 2011)

A Tree Search Approach to Sparse Coding. - Rui Jorge Rei; João Pedro Pedroso; Hideitsu Hino; Noboru Murata (LION, 2012)

A MILP-Based Approach for Hydrothermal Scheduling. - Dewan Fayzur Rahman; Ana Viana; João Pedro Pedroso (OR, 2012)

Heuristic search for the stacking problem. - Rui Jorge Rei; João Pedro Pedroso (Int. Trans. Oper. Res., 2012)

Tree search for the stacking problem. - Rui Jorge Rei; João Pedro Pedroso (Ann. Oper. Res., 2013)

Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression. - Filipe Brandão; João Pedro Pedroso (CoRR, 2013)

A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability. - Teresa Neto; Miguel Constantino; Isabel Martins; João Pedro Pedroso (Int. Trans. Oper. Res., 2013)

Maximizing Expectation on Vertex-Disjoint Cycle Packing. - João Pedro Pedroso (ICCSA (2), 2014)

Fast pattern-based algorithms for cutting stock. - Filipe Brandão; João Pedro Pedroso (Comput. Oper. Res., 2014)

An evolutionary solver for linear integer programming. - João Pedro Pedroso (CoRR, 2014)

Unit commitment with valve-point loading effect. - João Pedro Pedroso; Mikio Kubo; Ana Viana (CoRR, 2014)

Equilibria on a Game with Discrete Variables. - João Pedro Pedroso; Yves Smees (CoRR, 2014)

A complete search method for the relaxed traveling tournament problem. - Filipe Brandão; João Pedro Pedroso (EURO J. Comput. Optim., 2014)

A tabu search for the permutation flow shop problem with sequence dependent setup times. - Nicolau Santos; Rui Rebelo; João Pedro Pedroso (Int. J. Data Anal. Tech. Strateg., 2014)

Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression. - Filipe Brandão; João Pedro Pedroso (CoRR, 2015)

Certifying execution time in multicores. - Vítor Rodrigues; Benny Akesson; Mário Florido; Simão Melo de Sousa; João Pedro Pedroso; Pedro B. Vasconcelos (Sci. Comput. Program., 2015)

PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite. - Stephen J. Maher; Matthias Miltenberger; João Pedro Pedroso; Daniel Rehfeldt; Robert Schwarz; Felipe Serrano 001 (ICMS, 2016)

Bin packing and related problems: General arc-flow formulation with graph compression. - Filipe Brandão; João Pedro Pedroso (Comput. Oper. Res., 2016)

Maximising expectation of the number of transplants in kidney exchange programmes. - Xenia Klimentova; João Pedro Pedroso; Ana Viana (Comput. Oper. Res., 2016)

A Practical Algorithm for Packing Tubes and Boxes. - João Pedro Pedroso; João Nuno Tavares; Jorge Leite (CoRR, 2016)

Recursive circle packing problems. - João Pedro Pedroso; Sílvia Cunha; João Nuno Tavares (Int. Trans. Oper. Res., 2016)

Forest harvest scheduling with clearcut and core area constraints. - Teresa Neto; Miguel Constantino; Isabel Martins; João Pedro Pedroso (Ann. Oper. Res., 2017)

Exact Methods for Recursive Circle Packing. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (CoRR, 2017)

Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic. - Jésica de Armas; Angel A. Juan; Joan Manuel Marquès; João Pedro Pedroso (J. Oper. Res. Soc., 2017)

Kidney exchange simulation and optimization. - Nicolau Santos; Paolo Tubertini; Ana Viana; João Pedro Pedroso (J. Oper. Res. Soc., 2017)

Nash equilibria in the two-player kidney exchange game. - Margarida Carvalho; Andrea Lodi 001; João Pedro Pedroso; Ana Viana (Math. Program., 2017)

The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface. - João Pedro Pedroso; Kramer Alpar-Vajk; Ke Zhang (CoRR, 2018)

Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes. - Péter Biró 001; Márton Gyetvai; Xenia Klimentova; João Pedro Pedroso; William Pettersson; Ana Viana (ECMS, 2020)

Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. - Ambros M. Gleixner; Stephen J. Maher; Benjamin Müller 002; João Pedro Pedroso (Ann. Oper. Res., 2020)

Computing Nash equilibria for integer programming games. - Margarida Carvalho; Andrea Lodi 001; João Pedro Pedroso (CoRR, 2020)

A multi-objective Monte Carlo tree search for forest harvest scheduling. - Teresa Neto; Miguel Constantino; Isabel Martins; João Pedro Pedroso (Eur. J. Oper. Res., 2020)

Heuristics for packing semifluids. - João Pedro Pedroso (Eur. J. Oper. Res., 2020)

A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals. - Marco Silva 003; João Pedro Pedroso; Ana Viana; Xenia Klimentova (ATMOS, 2021)

The Sea Exploration Problem Revisited. - João Dionísio; Davi dos Santos; João Pedro Pedroso (LOD, 2021)

A comparison of matching algorithms for kidney exchange programs addressing waiting time. - Tiago Monteiro; Xenia Klimentova; João Pedro Pedroso; Ana Viana (Central Eur. J. Oper. Res., 2021)

The Probabilistic Travelling Salesman Problem with Crowdsourcing. - Alberto Santini; Ana Viana; Xenia Klimentova; João Pedro Pedroso (Comput. Oper. Res., 2022)

Computing equilibria for integer programming games. - Margarida Carvalho; Andrea Lodi 001; João Pedro Pedroso (Eur. J. Oper. Res., 2022)

A data-driven compensation scheme for last-mile delivery with crowdsourcing. - Miguel Barbosa; João Pedro Pedroso; Ana Viana (Comput. Oper. Res., 2023)

Deep reinforcement learning for stochastic last-mile delivery with crowdshipping. - Marco Silva 003; João Pedro Pedroso; Ana Viana (EURO J. Transp. Logist., 2023)

Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints. - Marco Silva 003; João Pedro Pedroso; Ana Viana (Eur. J. Oper. Res., 2023)

Novel integer programming models for the stable kidney exchange problem. - Xenia Klimentova; Péter Biró 001; Ana Viana; Virginia Costa; João Pedro Pedroso (Eur. J. Oper. Res., 2023)

Kumon-Inspired Approach to Teaching Programming Fundamentals. - Ivone Amorim; Pedro B. Vasconcelos; João Pedro Pedroso (ICPEC, 2024)

Local stability in kidney exchange programs. - Marie Baratto; Yves Crama; João Pedro Pedroso; Ana Viana (Eur. J. Oper. Res., 2025)

Maximum-expectation matching under recourse. - João Pedro Pedroso; Shiro Ikeda (Eur. J. Oper. Res., 2025)