default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEduardo C. Xavier
Person information
- affiliation: University of Campinas, Sao Paulo, Brazil
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Vinicius N. G. Pereira, Mário César San Felice
, Pedro Henrique Del Bianco Hokama, Eduardo Candido Xavier:
On the Restricted Steiner Multi Cycle Problem. Comput. Oper. Res. 169: 106752 (2024)- [c17]Brenner Humberto Ojeda Rios, Eduardo C. Xavier:
The Capacitated Multi-Depot Vehicle Routing Problem with Stochastic Pickups and Deliveries. CLEI 2024: 1-8 - 2021
- [j32]Brenner Humberto Ojeda Rios, Eduardo C. Xavier, Flávio Keidi Miyazawa, Pedro Amorim, Eduardo Curcio, Maria João Santos:
Recent dynamic vehicle routing problems: A survey. Comput. Ind. Eng. 160: 107604 (2021) - 2020
- [j31]Yulle G. F. Borges, Flávio Keidi Miyazawa, Rafael C. S. Schouery, Eduardo C. Xavier:
Exact algorithms for class-constrained packing problems. Comput. Ind. Eng. 144: 106455 (2020) - [j30]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier:
Randomized approximation scheme for Steiner Multi Cycle in the Euclidean plane. Theor. Comput. Sci. 835: 134-155 (2020) - [c16]Brenner H. O. Rios, Eduardo C. Xavier, Flávio Keidi Miyazawa, Pedro Amorim:
Heuristic Approaches for the Stochastic Multi-depot Vehicle Routing Problem with Pickup and Delivery. WCO@FedCSIS 2020: 27-51 - [c15]Brenner H. O. Rios, Eduardo C. Xavier, Flávio Keidi Miyazawa, Pedro Amorim:
Stochastic multi-depot vehicle routing problem with pickup and delivery: an ILS approach. FedCSIS 2020: 307-315
2010 – 2019
- 2019
- [j29]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Online circle and sphere packing. Theor. Comput. Sci. 776: 75-94 (2019) - [c14]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Phablo F. S. Moura, Eduardo C. Xavier:
Quasilinear Approximation Scheme for Steiner Multi Cycle in the Euclidean plane. LAGOS 2019: 589-601 - 2018
- [j28]Kent E. Yucra Quispe, Carla Negri Lintzmayer, Eduardo C. Xavier:
An exact algorithm for the Blocks Relocation Problem with new lower bounds. Comput. Oper. Res. 99: 206-217 (2018) - [j27]Marcelo G. Póvoa, Eduardo C. Xavier:
Approximation algorithms and heuristics for task scheduling in data-intensive distributed systems. Int. Trans. Oper. Res. 25(5): 1417-1441 (2018) - [j26]Jacques Wainer, Eduardo C. Xavier:
A Controlled Experiment on Python vs C for an Introductory Programming Course: Students' Outcomes. ACM Trans. Comput. Educ. 18(3): 12:1-12:16 (2018) - [c13]Thiago Crepaldi, Nelson L. S. da Fonseca, Eduardo C. Xavier:
Selection of Servers for Video on Demand Service over Hybrid Cloud. ICC 2018: 1-7 - [c12]Félix Carvalho Rodrigues, Guido Schäfer, Eduardo C. Xavier:
On the Effectiveness of Connection Tolls in Fair Cost Facility Location Games. ICTCS 2018: 36-47 - [c11]Alexre T. Hirata, Eduardo C. Xavier, Juliana Freitag Borin:
Optimal and Heuristic Decision Strategies for Load Balancing and User Association on HetNets. ISCC 2018: 1143-1148 - [c10]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Two-Dimensional Knapsack for Circles. LATIN 2018: 741-754 - [c9]Vinicius N. G. Pereira, Mário César San Felice, Pedro Henrique Del Bianco Hokama, Eduardo C. Xavier:
The Steiner Multi Cycle Problem with Applications to a Collaborative Truckload Problem. SEA 2018: 26:1-26:13 - [c8]Félix Carvalho Rodrigues, Eduardo C. Xavier, Guido Schäfer:
On Fair Cost Facility Location Games with Non-singleton Players. CLEI Selected Papers 2018: 21-38 - 2017
- [j25]Félix Carvalho Rodrigues, Eduardo Candido Xavier:
Non-cooperative capacitated facility location games. Inf. Process. Lett. 117: 45-53 (2017) - [j24]Rafael F. Santos, Alessandro Andrioni, André C. Drummond, Eduardo C. Xavier:
Multicolour paths in graphs: NP-hardness, algorithms, and applications on routing in WDM networks. J. Comb. Optim. 33(2): 742-778 (2017) - [j23]Félix Carvalho Rodrigues, Eduardo C. Xavier:
Non-Cooperative Facility Location Games: a Survey. RITA 24(1): 59-90 (2017) - [i2]Carla Negri Lintzmayer, Flávio Keidi Miyazawa, Eduardo Candido Xavier:
Online Circle and Sphere Packing. CoRR abs/1708.08906 (2017) - 2016
- [j22]Pedro Henrique Del Bianco Hokama, Flávio Keidi Miyazawa, Eduardo C. Xavier:
A branch-and-cut approach for the vehicle routing problem with loading constraints. Expert Syst. Appl. 47: 1-13 (2016) - [j21]Bruno Cardoso Lopes, Leonardo Luiz Ecco, E. C. Xavier, Rodolfo Jardim de Azevedo:
Design and evaluation of compact ISA extensions. Microprocess. Microsystems 40: 1-15 (2016) - 2015
- [j20]Douglas Oliveira Santos, Eduardo C. Xavier:
Taxi and Ride Sharing: A Dynamic Dial-a-Ride Problem with Money as an Incentive. Expert Syst. Appl. 42(19): 6728-6737 (2015) - [j19]Eduardo C. Xavier, Robson R. S. Peixoto, Jefferson L. M. da Silveira:
Scheduling with task replication on desktop grids: theoretical and experimental analysis. J. Comb. Optim. 30(3): 520-544 (2015) - [j18]Andrew Twigg, Eduardo C. Xavier:
Locality-preserving allocations problems and coloured bin packing. Theor. Comput. Sci. 596: 12-22 (2015) - [i1]Andrew Twigg, Eduardo C. Xavier:
Locality-preserving allocations Problems and coloured Bin Packing. CoRR abs/1508.03992 (2015) - 2014
- [j17]Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two-dimensional strip packing with unloading constraints. Discret. Appl. Math. 164: 512-521 (2014) - [c7]Jefferson L. M. da Silveira, Eduardo C. Xavier:
Pickup and Delivery Problem with Two Dimensional Loading/Unloading Constraints. ICCL 2014: 31-46 - [c6]Eduardo T. Bogue, Cid C. de Souza, Eduardo C. Xavier, Alexandre S. Freire:
An Integer Programming Formulation for the Maximum k-Subset Intersection Problem. ISCO 2014: 87-99 - 2013
- [j16]Jefferson L. M. da Silveira, Flávio Keidi Miyazawa, Eduardo C. Xavier:
Heuristics for the strip packing problem with unloading constraints. Comput. Oper. Res. 40(4): 991-1003 (2013) - [j15]Jefferson Luiz Moisés da Silveira, Eduardo Candido Xavier, Flávio Keidi Miyazawa:
A note on a two dimensional knapsack problem with unloading constraints. RAIRO Theor. Informatics Appl. 47(4): 315-324 (2013) - [c5]Douglas Oliveira Santos, Eduardo Candido Xavier:
Dynamic Taxi and Ridesharing: A Framework and Heuristics for the Optimization Problem. IJCAI 2013: 2885-2891 - 2012
- [j14]Gustavo B. Figueiredo, Eduardo Candido Xavier, Nelson L. S. da Fonseca:
Optimal algorithms for the batch scheduling problem in OBS networks. Comput. Networks 56(14): 3274-3286 (2012) - [j13]Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, Eduardo C. Xavier:
Algorithms for 3D guillotine cutting problems: Unbounded knapsack, cutting stock and strip packing. Comput. Oper. Res. 39(2): 200-212 (2012) - [j12]Aline M. Del Valle, Thiago Alves de Queiroz, Flávio Keidi Miyazawa, Eduardo C. Xavier:
Heuristics for two-dimensional knapsack and cutting stock problems with items of irregular shape. Expert Syst. Appl. 39(16): 12589-12598 (2012) - [j11]Eduardo C. Xavier:
A note on a Maximum k-Subset Intersection problem. Inf. Process. Lett. 112(12): 471-472 (2012) - 2011
- [j10]Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two Dimensional Strip Packing with Unloading Constraints. Electron. Notes Discret. Math. 37: 99-104 (2011) - [j9]Jefferson L. M. da Silveira, Eduardo C. Xavier, Flávio Keidi Miyazawa:
Two Dimensional Knapsack with Unloading Constraints. Electron. Notes Discret. Math. 37: 267-272 (2011) - 2010
- [c4]Eduardo C. Xavier, Robson R. S. Peixoto:
On the Worst Case of Scheduling with Task Replication on Computational Grids. SBAC-PAD 2010: 135-142
2000 – 2009
- 2009
- [j8]Eduardo C. Xavier, Flávio Keidi Miyazawa:
A note on dual approximation algorithms for class constrained bin packing problems. RAIRO Theor. Informatics Appl. 43(2): 239-248 (2009) - [j7]Jacques Wainer, Eduardo C. Xavier, Fábio de Lima Bezerra:
Scientific production in Computer Science: A comparative study of Brazil and other countries. Scientometrics 81(2): 535-547 (2009) - [c3]Gustavo B. Figueiredo, Eduardo C. Xavier, Nelson L. S. da Fonseca:
An Optimal Batch Scheduling Algorithm for OBS Networks. GLOBECOM 2009: 1-6 - [c2]Leonardo Luiz Ecco, Bruno Cardoso Lopes, Eduardo Candido Xavier, Ricardo Pannain, Paulo Centoducatte, Rodolfo Jardim de Azevedo:
SPARC16: A New Compression Approach for the SPARC Architecture. SBAC-PAD 2009: 169-176 - 2008
- [j6]E. C. Xavier, Flávio Keidi Miyazawa:
A one-dimensional bin packing problem with shelf divisions. Discret. Appl. Math. 156(7): 1083-1096 (2008) - [j5]G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier:
Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation. Eur. J. Oper. Res. 191(1): 61-85 (2008) - [j4]E. C. Xavier, Flávio Keidi Miyazawa:
The class constrained bin packing problem with applications to video-on-demand. Theor. Comput. Sci. 393(1-3): 240-259 (2008) - 2007
- [j3]G. F. Cintra, Flávio Keidi Miyazawa, Yoshiko Wakabayashi, E. C. Xavier:
A note on the approximability of cutting stock problems. Eur. J. Oper. Res. 183(3): 1328-1332 (2007) - 2006
- [j2]E. C. Xavier, Flávio Keidi Miyazawa:
Approximation schemes for knapsack problems with shelf divisions. Theor. Comput. Sci. 352(1-3): 71-84 (2006) - [c1]E. C. Xavier, Flávio Keidi Miyazawa:
The Class Constrained Bin Packing Problem with Applications to Video-on-Demand. COCOON 2006: 439-448 - 2005
- [j1]E. C. Xavier, Flávio Keidi Miyazawa:
A one-dimensional bin packing problem with shelf divisions. Electron. Notes Discret. Math. 19: 329-335 (2005)
Coauthor Index
aka: Jefferson Luiz Moisés da Silveira
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-30 21:30 CET 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:
