8 citations · 12 across the 13 of their papers we have counts for
6 papers · 1 filter
Maximum Customers' Satisfaction in One-way Car-sharing: Modeling, Exact and Heuristic Solving
Welverton R. Silva, Rafael C. S. Schouery
One-way car-sharing systems are transportation systems that allow customers to rent cars at stations scattered around the city, use them for a short journey, and return them at any…
Tight Bounds for the Price of Anarchy and Stability in Sequential Transportation Games
Francisco J. M. da Silva, Flávio K. Miyazawa, Ieremies V. F. Romero +1
In this paper, we analyze a transportation game first introduced by Fotakis, Gourvès, and Monnot in 2017, where players want to be transported to a common destination as quickly as…
Computing the Largest Bond and the Maximum Connected Cut of a Graph
Gabriel L. Duarte, Hiroshi Eto, Tesshu Hanaka +6
The cut-set of a graph is the set of edges that have one endpoint in and the other endpoint in , and whenever is connected…
Graphs without gap-vertex-labellings: families and bounds
C. A. Weffort-Santos, R. C. S. Schouery
A proper labelling of a graph is a pair in which is an assignment of numeric labels to some elements of , and is a colouring induced by through some…
Budget-balanced and strategy-proof auctions for multi-passenger ridesharing
Leonardo Y. Schwarzstein, Rafael C. S. Schouery
Ridesharing and ridesourcing services have become widespread, and pricing the rides is a crucial problem for these systems. We propose and analyze a budget-balanced and strategy-pr…
Local-Search Based Heuristics for Advertisement Scheduling
Mauro R. C. da Silva, Rafael C. S. Schouery
In the MAXSPACE problem, given a set of ads A, one wants to place a subset A' of A into K slots B_1, ..., B_K of size L. Each ad A_i in A has size s_i and frequency w_i. A schedule…