default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoão Pedro Pedroso
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j28]Marie Baratto
, Yves Crama, João Pedro Pedroso, Ana Viana:
Local stability in kidney exchange programs. Eur. J. Oper. Res. 320(1): 20-34 (2025)- 2024
- [c16]Ivone Amorim, Pedro B. Vasconcelos, João Pedro Pedroso:
Kumon-Inspired Approach to Teaching Programming Fundamentals. ICPEC 2024: 5:1-5:13 - 2023
- [j27]Miguel Barbosa, João Pedro Pedroso, Ana Viana:
A data-driven compensation scheme for last-mile delivery with crowdsourcing. Comput. Oper. Res. 150: 106059 (2023) - [j26]Marco Silva, João Pedro Pedroso, Ana Viana:
Deep reinforcement learning for stochastic last-mile delivery with crowdshipping. EURO J. Transp. Logist. 12: 100105 (2023) - [j25]Marco Silva, João Pedro Pedroso, Ana Viana:
Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints. Eur. J. Oper. Res. 307(1): 249-265 (2023) - [j24]Xenia Klimentova, Péter Biró, Ana Viana, Virginia Costa, João Pedro Pedroso:
Novel integer programming models for the stable kidney exchange problem. Eur. J. Oper. Res. 307(3): 1391-1407 (2023) - 2022
- [j23]Alberto Santini, Ana Viana, Xenia Klimentova, João Pedro Pedroso:
The Probabilistic Travelling Salesman Problem with Crowdsourcing. Comput. Oper. Res. 142: 105722 (2022) - [j22]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso:
Computing equilibria for integer programming games. Eur. J. Oper. Res. 303(3): 1057-1070 (2022) - 2021
- [j21]Tiago Monteiro, Xenia Klimentova, João Pedro Pedroso, Ana Viana:
A comparison of matching algorithms for kidney exchange programs addressing waiting time. Central Eur. J. Oper. Res. 29(2): 539-552 (2021) - [c15]Marco Silva, João Pedro Pedroso, Ana Viana, Xenia Klimentova:
A Branch-Price-And-Cut Algorithm for Stochastic Crowd Shipping Last-Mile Delivery with Correlated Marginals. ATMOS 2021: 12:1-12:20 - [c14]João Dionísio, Davi dos Santos, João Pedro Pedroso:
The Sea Exploration Problem Revisited. LOD 2021: 626-640 - 2020
- [j20]Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso:
Price-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decomposition. Ann. Oper. Res. 284(2): 527-555 (2020) - [j19]João Pedro Pedroso:
Heuristics for packing semifluids. Eur. J. Oper. Res. 282(3): 823-834 (2020) - [j18]Teresa Neto, Miguel Constantino, Isabel Martins, João Pedro Pedroso:
A multi-objective Monte Carlo tree search for forest harvest scheduling. Eur. J. Oper. Res. 282(3): 1115-1126 (2020) - [c13]Péter Biró, Márton Gyetvai, Xenia Klimentova, João Pedro Pedroso, William Pettersson, Ana Viana:
Compensation Scheme With Shapley Value For Multi-Country Kidney Exchange Programmes. ECMS 2020: 129-136 - [i13]Xenia Klimentova, Péter Biró, Ana Viana, Virginia Costa, João Pedro Pedroso:
Novel Integer Programming models for the stable kidney exchange problem. CoRR abs/2012.04918 (2020) - [i12]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso:
Computing Nash equilibria for integer programming games. CoRR abs/2012.07082 (2020)
2010 – 2019
- 2018
- [i11]João Pedro Pedroso, Kramer Alpar-Vajk, Ke Zhang:
The Sea Exploration Problem: Data-driven Orienteering on a Continuous Surface. CoRR abs/1802.01482 (2018) - 2017
- [j17]Teresa Neto, Miguel Constantino, Isabel Martins, João Pedro Pedroso:
Forest harvest scheduling with clearcut and core area constraints. Ann. Oper. Res. 258(2): 453-478 (2017) - [j16]Jésica de Armas, Angel A. Juan, Joan Manuel Marquès, João Pedro Pedroso:
Solving the deterministic and stochastic uncapacitated facility location problem: from a heuristic to a simheuristic. J. Oper. Res. Soc. 68(10): 1161-1176 (2017) - [j15]Nicolau Santos, Paolo Tubertini, Ana Viana, João Pedro Pedroso:
Kidney exchange simulation and optimization. J. Oper. Res. Soc. 68(12): 1521-1532 (2017) - [j14]Margarida Carvalho, Andrea Lodi, João Pedro Pedroso, Ana Viana:
Nash equilibria in the two-player kidney exchange game. Math. Program. 161(1-2): 389-417 (2017) - [i10]Ambros M. Gleixner, Stephen J. Maher, Benjamin Müller, João Pedro Pedroso:
Exact Methods for Recursive Circle Packing. CoRR abs/1702.07799 (2017) - 2016
- [j13]Filipe Brandão, João Pedro Pedroso:
Bin packing and related problems: General arc-flow formulation with graph compression. Comput. Oper. Res. 69: 56-67 (2016) - [j12]Xenia Klimentova, João Pedro Pedroso, Ana Viana:
Maximising expectation of the number of transplants in kidney exchange programmes. Comput. Oper. Res. 73: 1-11 (2016) - [j11]João Pedro Pedroso, Sílvia Cunha, João Nuno Tavares:
Recursive circle packing problems. Int. Trans. Oper. Res. 23(1-2): 355-368 (2016) - [c12]Stephen J. Maher, Matthias Miltenberger, João Pedro Pedroso, Daniel Rehfeldt, Robert Schwarz, Felipe Serrano:
PySCIPOpt: Mathematical Programming in Python with the SCIP Optimization Suite. ICMS 2016: 301-307 - [i9]João Pedro Pedroso, Shiro Ikeda:
Maximum-expectation matching under recourse. CoRR abs/1605.08616 (2016) - [i8]João Pedro Pedroso:
Heuristics for Packing Semifluids. CoRR abs/1607.04403 (2016) - [i7]João Pedro Pedroso, João Nuno Tavares, Jorge Leite:
A Practical Algorithm for Packing Tubes and Boxes. CoRR abs/1609.07676 (2016) - 2015
- [j10]Vítor Rodrigues, Benny Akesson, Mário Florido, Simão Melo de Sousa, João Pedro Pedroso, Pedro B. Vasconcelos:
Certifying execution time in multicores. Sci. Comput. Program. 111: 505-534 (2015) - [i6]Filipe Brandão, João Pedro Pedroso:
Cutting Stock with Binary Patterns: Arc-flow Formulation with Graph Compression. CoRR abs/1502.02899 (2015) - 2014
- [j9]Filipe Brandão, João Pedro Pedroso:
Fast pattern-based algorithms for cutting stock. Comput. Oper. Res. 48: 69-80 (2014) - [j8]Filipe Brandão, João Pedro Pedroso:
A complete search method for the relaxed traveling tournament problem. EURO J. Comput. Optim. 2(1-2): 77-86 (2014) - [j7]Nicolau Santos, Rui Rebelo, João Pedro Pedroso:
A tabu search for the permutation flow shop problem with sequence dependent setup times. Int. J. Data Anal. Tech. Strateg. 6(3): 275-285 (2014) - [c11]João Pedro Pedroso:
Maximizing Expectation on Vertex-Disjoint Cycle Packing. ICCSA (2) 2014: 32-46 - [i5]João Pedro Pedroso, Mikio Kubo, Ana Viana:
Unit commitment with valve-point loading effect. CoRR abs/1404.4944 (2014) - [i4]João Pedro Pedroso:
An evolutionary solver for linear integer programming. CoRR abs/1407.7211 (2014) - [i3]João Pedro Pedroso, Yves Smees:
Equilibria on a Game with Discrete Variables. CoRR abs/1407.8394 (2014) - 2013
- [j6]Rui Jorge Rei, João Pedro Pedroso:
Tree search for the stacking problem. Ann. Oper. Res. 203(1): 371-388 (2013) - [j5]Teresa Neto, Miguel Constantino, Isabel Martins, João Pedro Pedroso:
A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability. Int. Trans. Oper. Res. 20(5): 689-709 (2013) - [i2]Filipe Brandão, João Pedro Pedroso:
Bin Packing and Related Problems: General Arc-flow Formulation with Graph Compression. CoRR abs/1310.6887 (2013) - [i1]Filipe Brandão, João Pedro Pedroso:
Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression. CoRR abs/1312.3836 (2013) - 2012
- [j4]Rui Jorge Rei, João Pedro Pedroso:
Heuristic search for the stacking problem. Int. Trans. Oper. Res. 19(3): 379-395 (2012) - [c10]Rui Jorge Rei, João Pedro Pedroso, Hideitsu Hino, Noboru Murata:
A Tree Search Approach to Sparse Coding. LION 2012: 472-477 - [c9]Dewan Fayzur Rahman, Ana Viana, João Pedro Pedroso:
A MILP-Based Approach for Hydrothermal Scheduling. OR 2012: 157-162 - 2011
- [c8]Vítor Rodrigues, João Pedro Pedroso, Mário Florido, Simão Melo de Sousa:
Certifying Execution Time. FOPARA 2011: 108-125 - 2010
- [j3]João Pedro Pedroso, Mikio Kubo:
Heuristics and exact methods for number partitioning. Eur. J. Oper. Res. 202(1): 73-81 (2010) - [c7]João Pedro Pedroso:
Metaheuristics for the Asymmetric Hamiltonian Path Problem. NMA 2010: 272-279
2000 – 2009
- 2008
- [j2]Pedro Pereira Rodrigues, João Gama, João Pedro Pedroso:
Hierarchical Clustering of Time-Series Data Streams. IEEE Trans. Knowl. Data Eng. 20(5): 615-627 (2008) - [c6]Rui Jorge Rei, Mikio Kubo, João Pedro Pedroso:
Simulation-Based Optimization for Steel Stacking. MCO 2008: 254-263 - 2007
- [c5]João Pedro Pedroso:
Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming. SLS 2007: 217-221 - 2006
- [c4]Pedro Pereira Rodrigues, João Gama, João Pedro Pedroso:
ODAC: Hierarchical Clustering of Time Series Data Streams. SDM 2006: 499-503 - 2005
- [c3]João Pedro Pedroso, Mikio Kubo:
Hybrid Tabu Search for Lot Sizing Problems. Hybrid Metaheuristics 2005: 66-77 - 2001
- [j1]João Pedro Pedroso, Noboru Murata:
Support vector machines with different norms: motivation, formulations and results. Pattern Recognit. Lett. 22(12): 1263-1272 (2001) - 2000
- [c2]João Pedro Pedroso, Noboru Murata:
Optimization on Support Vector Machines. IJCNN (6) 2000: 399-404
1990 – 1999
- 1996
- [c1]João Pedro Pedroso:
Niche Search: An Evolutionary Algorithm for Global Optimisation. PPSN 1996: 430-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:35 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
