Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Interest
Topics
Details

Details

005
Publications

2020

Heuristics for Packing Semifluids

Authors
Pedroso, JP;

Publication
CoRR

Abstract

2020

A multi-objective Monte Carlo tree search for forest harvest scheduling

Authors
Neto, T; Constantino, M; Martins, I; Pedroso, JP;

Publication
European Journal of Operational Research

Abstract

2020

A comparison of matching algorithms for kidney exchange programs addressing waiting time

Authors
Monteiro, T; Klimentova, X; Pedroso, JP; Viana, A;

Publication
Central European Journal of Operations Research

Abstract

2020

Price-and-verify: a new algorithm for recursive circle packing using Dantzig–Wolfe decomposition

Authors
Gleixner, A; Maher, SJ; Mueller, B; Pedroso, JP;

Publication
Annals of Operations Research

Abstract

2018

Competitive uncapacitated lot-sizing game

Authors
Carvalho, M; Pedroso, JP; Telha, C; Van Vyve, M;

Publication
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS

Abstract
We study the strategical behaviour of firms facing a lot-sizing problem with Cournot competition. Each player is a firm with her own production facility, modeled as an uncapacitated lot-sizing problem (Le., production incurs set-up and variable costs and inventories are allowed). A Cournot competition is played in each time period (market) with each player deciding the quantity of product to place on it. The market price of that product in each time period depends on the total quantity placed in the market. We show that this is a potential game with possibly multiple pure Nash equilibria. We then investigate the plausibility of these equilibria to predict the game outcome by evaluating the difficulty of computing them. If the game has a single period, we prove that an equilibrium can be found in polynomial time, but it is weakly NP hard to find an optimal pure Nash equilibrium (with respect to a given equilibrium refinement). If the game has no variable production and inventory costs, we prove that a pure Nash equilibrium can be computed in polynomial time.

Supervised
thesis

2019

Domain specific languages for kidney exchange programs

Author
João Viana

Institution
UP-FCUP

2019

A data-driven compensation scheme for last-mile delivery with crowdsourcing

Author
Miguel Moreira da Silva Lima Barbosa

Institution
UP-FCUP

2019

An EDSL for Modeling Kidney Exchange Programs

Author
João Paulo Rocha Viana

Institution
UP-FCUP

2018

Artifical Intelligence for Jobshop Scheduling

Author
Nicolau Filipe Barbosa Veludo dos Santos

Institution
UP-FCUP

2018

Monte Carlo Tree Search for Combinatorial Optimization

Author
Rui Jorge Rodrigues Rei

Institution
UP-FCUP