Eduardo C. Xavier

Orcid: 0000-0001-6030-2682

  • University of Campinas, Sao Paulo, Brazil

According to our database1, Eduardo C. Xavier authored at least 45 papers between 2005 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


Online presence:



Recent dynamic vehicle routing problems: A survey.
Comput. Ind. Eng., 2021

Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane.
Theor. Comput. Sci., 2020

Exact algorithms for class-constrained packing problems.
Comput. Ind. Eng., 2020

Heuristic Approaches for the Stochastic Multi-depot Vehicle Routing Problem with Pickup and Delivery.
Proceedings of the Recent Advances in Computational Optimization, 2020

Stochastic multi-depot vehicle routing problem with pickup and delivery: an ILS approach.
Proceedings of the 2020 Federated Conference on Computer Science and Information Systems, 2020

Online circle and sphere packing.
Theor. Comput. Sci., 2019

Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

A Controlled Experiment on Python vs C for an Introductory Programming Course: Students' Outcomes.
ACM Trans. Comput. Educ., 2018

Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems.
Int. Trans. Oper. Res., 2018

On Fair Cost Facility Location Games with Non-singleton Players.
Proceedings of the XLIV Latin American Computer Conference - Selected Papers, 2018

An exact algorithm for the Blocks Relocation Problem with new lower bounds.
Comput. Oper. Res., 2018

The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem.
Proceedings of the 17th International Symposium on Experimental Algorithms, 2018

Two-Dimensional Knapsack for Circles.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Optimal and Heuristic Decision Strategies for Load Balancing and User Association on HetNets.
Proceedings of the 2018 IEEE Symposium on Computers and Communications, 2018

On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games.
Proceedings of the 19th Italian Conference on Theoretical Computer Science, 2018

Selection of Servers for Video on Demand Service over Hybrid Cloud.
Proceedings of the 2018 IEEE International Conference on Communications, 2018

Non-Cooperative Facility Location Games: a Survey.
RITA, 2017

Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks.
J. Comb. Optim., 2017

Non-cooperative capacitated facility location games.
Inf. Process. Lett., 2017

Design and evaluation of compact ISA extensions.
Microprocess. Microsystems, 2016

A branch-and-cut approach for the vehicle routing problem with loading constraints.
Expert Syst. Appl., 2016

Locality-preserving allocations problems and coloured bin packing.
Theor. Comput. Sci., 2015

Scheduling with task replication on desktop grids: theoretical and experimental analysis.
J. Comb. Optim., 2015

Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive.
Expert Syst. Appl., 2015

An Integer Programming Formulation for the Maximum k-Subset Intersection Problem.
Proceedings of the Combinatorial Optimization - Third International Symposium, 2014

Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints.
Proceedings of the Computational Logistics - 5th International Conference, 2014

A note on a two dimensional knapsack problem with unloading constraints.
RAIRO Theor. Informatics Appl., 2013

Heuristics for the strip packing problem with unloading constraints.
Comput. Oper. Res., 2013

Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem.
Proceedings of the IJCAI 2013, 2013

A note on a Maximum k-Subset Intersection problem.
Inf. Process. Lett., 2012

Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape.
Expert Syst. Appl., 2012

Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing.
Comput. Oper. Res., 2012

Optimal algorithms for the batch scheduling problem in OBS networks.
Comput. Networks, 2012

Two Dimensional Knapsack with Unloading Constraints.
Electron. Notes Discret. Math., 2011

Two Dimensional Strip Packing with Unloading Constraints.
Electron. Notes Discret. Math., 2011

On the Worst Case of Scheduling with Task Replication on Computational Grids.
Proceedings of the 22st International Symposium on Computer Architecture and High Performance Computing, 2010

Scientific production in Computer Science: A comparative study of Brazil and other countries.
Scientometrics, 2009

A note on dual approximation algorithms for class constrained bin packing problems.
RAIRO Theor. Informatics Appl., 2009

SPARC16: A New Compression Approach for the SPARC Architecture.
Proceedings of the 21st International Symposium on Computer Architecture and High Performance Computing, 2009

An Optimal Batch Scheduling Algorithm for OBS Networks.
Proceedings of the Global Communications Conference, 2009. GLOBECOM 2009, Honolulu, Hawaii, USA, 30 November, 2009

The class constrained bin packing problem with applications to video-on-demand.
Theor. Comput. Sci., 2008

Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation.
Eur. J. Oper. Res., 2008

A note on the approximability of cutting stock problems.
Eur. J. Oper. Res., 2007

Approximation schemes for knapsack problems with shelf divisions.
Theor. Comput. Sci., 2006

A one-dimensional bin packing problem with shelf divisions.
Electron. Notes Discret. Math., 2005