8 citations · 12 across the 13 of their papers we have counts for
17 papers
Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
Renan F. F. da Silva, Thiago A. de Queiroz, Rafael C. S. Schouery
The Knapsack Problem (KP) and its generalization, the Bounded Knapsack Problem (BKP), are classical NP-hard problems with numerous practical applications, and despite being introdu…
Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
Renan Fernando Franco da Silva, Vinícius Loti de Lima, Rafael C. S. Schouery +2
The Cutting Stock Problem (CSP) and Bin Packing Problem (BPP) are classical combinatorial optimization problems extensively studied since the 1960s. State-of-the-art exact algorith…
Approximation algorithms for the square min-sum bin packing problem
Rachel Vanucchi Saraiva, Rafael C. S. Schouery
In this work, we study the Square Min-Sum Bin Packing Problem (SMSBPP), where a list of square items has to be packed into square bins of dimensions with no overla…
Algorithms for the Bin Packing Problem with Scenarios
Yulle G. F. Borges, Vinícius L. de Lima, Flávio K. Miyazawa +3
This paper presents theoretical and practical results for the bin packing problem with scenarios, a generalization of the classical bin packing problem which considers the presence…
Mathematical Models and Exact Algorithms for the Colored Bin Packing Problem
Yulle G. F. Borges, Rafael C. S. Schouery, Flávio K. Miyazawa
This paper focuses on exact approaches for the Colored Bin Packing Problem (CBPP), a generalization of the classical one-dimensional Bin Packing Problem in which each item has, in…
On the approximability and energy-flow modeling of the electric vehicle sharing problem
Welverton R. Silva, Fábio L. Usberti, Rafael C. S. Schouery
The electric vehicle sharing problem (EVSP) arises from the planning and operation of one-way electric car-sharing systems. It aims to maximize the total rental time of a fleet of…
On the complexity and modeling of the electric vehicle sharing problem
Welverton R. Silva, Fábio L. Usberti, Rafael C. S. Schouery
We introduce the electric vehicle sharing problem (EVSP), a problem that arises from the planning and operation of electric car-sharing systems which allow one-way rental of vehicl…
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…
Computing the largest bond of a graph
Gabriel L. Duarte, Daniel Lokshtanov, Lehilton L. C. Pedrosa +2
A bond of a graph is an inclusion-wise minimal disconnecting set of , i.e., bonds are cut-sets that determine cuts of such that and $G[V\setmin…
Polynomial-Time Approximation Schemes for Circle and Other Packing Problems
Flávio K. Miyazawa, Lehilton L. C. Pedrosa, Rafael C. S. Schouery +2
We give an asymptotic approximation scheme (APTAS) for the problem of packing a set of circles into a minimum number of unit square bins. To obtain rational solutions, we use augme…
The Unit-Demand Envy-Free Pricing Problem
Cristina G. Fernandes, Carlos E. Ferreira, Álvaro J. P. Franco +1
We consider the unit-demand envy-free pricing problem, which is a unit-demand auction where each bidder receives an item that maximizes his utility, and the goal is to maximize the…
Approximation Algorithms for the Max-Buying Problem with Limited Supply
Cristina G. Fernandes, Rafael C. S. Schouery
We consider the Max-Buying Problem with Limited Supply, in which there are items, with copies of each item , and bidders such that every bidder has valuation $…