Luciana S. Buriol

According to our database1, Luciana S. Buriol authored at least 60 papers between 2003 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2020
A study on the pickup and delivery problem with time windows: Matheuristics and new instances.
Comput. Oper. Res., 2020

A biased random key genetic algorithm applied to the VRPTW with skill requirements and synchronization constraints.
Proceedings of the GECCO '20: Genetic and Evolutionary Computation Conference, 2020

Solving a physician rostering problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

A Multi-Start Algorithm and a Large Neighborhood Search for a Maritime Inventory Routing Problem.
Proceedings of the IEEE Congress on Evolutionary Computation, 2020

2019
Hybrid algorithms for placement of virtual machines across geo-separated data centers.
J. Comb. Optim., 2019

An empirical analysis of exact algorithms for the unbounded knapsack problem.
Eur. J. Oper. Res., 2019

2018
Network Optimization.
Proceedings of the Handbook of Heuristics., 2018

A branch-and-price algorithm for the single-path virtual network embedding problem.
Networks, 2018

A Branch-and-Price algorithm for a compressor scheduling problem.
Comput. Ind. Eng., 2018

A Matheuristic Approach to the Pickup and Delivery Problem with Time Windows.
Proceedings of the Computational Logistics - 9th International Conference, 2018

Applying a Relax-and-Fix Approach to a Fixed Charge Network Flow Model of a Maritime Inventory Routing Problem.
Proceedings of the Computational Logistics - 9th International Conference, 2018

2017
A column generation approach to high school timetabling modeled as a multicommodity flow problem.
Eur. J. Oper. Res., 2017

A fix-and-optimize approach for efficient and large scale virtual network function placement and chaining.
Comput. Commun., 2017

On the minimization of traffic congestion in road networks with tolls.
Ann. Oper. Res., 2017

A Relax-and-Fix Algorithm for a Maritime Inventory Routing Problem.
Proceedings of the Computational Logistics - 8th International Conference, 2017

2016
Pull and PushPull are PSPACE-complete.
Theor. Comput. Sci., 2016

How physical network topologies affect virtual network embedding quality: A characterization study based on ISP and datacenter networks.
J. Netw. Comput. Appl., 2016

A toolset for efficient privacy-oriented virtual network embedding and its instantiation on SDN/OpenFlow-based substrates.
Comput. Commun., 2016

Simulated annealing for the machine reassignment problem.
Ann. Oper. Res., 2016

UKP5: A New Algorithm for the Unbounded Knapsack Problem.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Improved Heuristic and Tie-Breaking for Optimally Solving Sokoban.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Optimal Sokoban solving using pattern databases with specific domain knowledge.
Artif. Intell., 2015

Piecing together the NFV provisioning puzzle: Efficient placement and chaining of virtual network functions.
Proceedings of the IFIP/IEEE International Symposium on Integrated Network Management, 2015

A Biased Random-key Genetic Algorithm for Placement of Virtual Machines across Geo-Separated Data Centers.
Proceedings of the Genetic and Evolutionary Computation Conference, 2015

Solving Sokoban Optimally with Domain-Dependent Move Pruning.
Proceedings of the 2015 Brazilian Conference on Intelligent Systems, 2015

2014
MOIRAE: A computational strategy to extract and represent structural information from experimental protein templates.
Soft Comput., 2014

A fix-and-optimize heuristic for the high school timetabling problem.
Comput. Oper. Res., 2014

Three-dimensional protein structure prediction: Methods and computational strategies.
Comput. Biol. Chem., 2014

Reconnecting Partitions on Physical Infrastructures: Towards an Expansion Strategy for Efficient Virtual Network Embedding.
Proceedings of the 2014 Brazilian Symposium on Computer Networks and Distributed Systems, 2014

A heuristic-based algorithm for privacy-oriented virtual network embedding.
Proceedings of the 2014 IEEE Network Operations and Management Symposium, 2014

2013
A molecular dynamics and knowledge-based computational strategy to predict native-like structures of polypeptides.
Expert Syst. Appl., 2013

Analyzing the impact of MOACO components: An algorithmic study on the multi-objective shortest path problem.
Expert Syst. Appl., 2013

An iterated sample construction with path relinking method: Application to switch allocation in electrical distribution networks.
Comput. Oper. Res., 2013

Finding Optimal Solutions to Sokoban Using Instance Dependent Pattern Databases.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

DoS-resilient virtual networks through multipath embedding and opportunistic recovery.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Trust-based grouping for cloud datacenters: Improving security in shared infrastructures.
Proceedings of the IFIP Networking Conference, 2013, Brooklyn, 2013

No more backups: Toward efficient embedding of survivable virtual networks.
Proceedings of IEEE International Conference on Communications, 2013

Characterizing the impact of network substrate topologies on virtual network embedding.
Proceedings of the 9th International Conference on Network and Service Management, 2013

A knowledge-based genetic algorithm to predict three-dimensional structures of polypeptides.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
Security-aware optimal resource allocation for virtual network embedding.
Proceedings of the 8th International Conference on Network and Service Management, 2012

2011
Modeling the webgraph evolution.
J. Comput. Sci., 2011

A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion.
Int. Trans. Oper. Res., 2011

Combining Machine Learning and Optimization Techniques to Determine 3-D Structures of Polypeptides.
Proceedings of the IJCAI 2011, 2011

GRACE: A Generational Randomized ACO for the Multi-objective Shortest Path Problem.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2011

Extending Traffic Simulation Based On Cellular Automata: From ParticlesTo Autonomous Agents.
Proceedings of the 25th European Conference on Modelling and Simulation, 2011

A hybrid genetic algorithm for the 3-D protein structure prediction problem using a path-relinking strategy.
Proceedings of the IEEE Congress on Evolutionary Computation, 2011

On the Smoothed Price of Anarchy of the Traffic Assignment Problem.
Proceedings of the ATMOS 2011, 2011

2010
A biased random-key genetic algorithm for road congestion minimization.
Optim. Lett., 2010

2008
Speeding Up Dynamic Shortest-Path Algorithms.
INFORMS J. Comput., 2008

2007
Survivable IP network design with OSPF routing.
Networks, 2007

A Sampling Data Stream Algorithm For Wireless Sensor Networks.
Proceedings of IEEE International Conference on Communications, 2007

Estimating Clustering Indexes in Data Streams.
Proceedings of the Algorithms, 2007

Data Stream Based Algorithms For Wireless Sensor Network Applications.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006
Preferential attachment in the growth of social networks: the case of Wikipedia
CoRR, 2006

Temporal Analysis of the Wikigraph.
Proceedings of the 2006 IEEE / WIC / ACM International Conference on Web Intelligence (WI 2006), 2006

Counting triangles in data streams.
Proceedings of the Twenty-Fifth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2006

A Study on the Use of Stemming for Monolingual Ad-Hoc Portuguese Information Retrieval.
Proceedings of the Evaluation of Multilingual and Multi-modal Information Retrieval, 2006

2005
A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing.
Networks, 2005

2004
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem.
J. Heuristics, 2004

2003
The Cutting-Stock Approach to Bin Packing: Theory and Experiments.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003


  Loading...