The following pages link to Luciana S. Buriol (Q266271):
Displaying 26 items.
- \textsc{Pull} and \textsc{PushPull} are PSPACE-complete (Q266272) (← links)
- A fix-and-optimize heuristic for the high school timetabling problem (Q337176) (← links)
- Simulated annealing for the machine reassignment problem (Q338857) (← links)
- An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks (Q339534) (← links)
- (Q513618) (redirect page) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
- Optimal Sokoban solving using pattern databases with specific domain knowledge (Q899157) (← links)
- A relax-and-fix algorithm for a maritime inventory routing problem (Q1691678) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- A column generation approach to high school timetabling modeled as a multicommodity flow problem (Q1752250) (← links)
- A new memetic algorithm for the asymmetric traveling salesman problem (Q1771206) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- An integer programming approach for the physician rostering problem (Q2241148) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- A study on the pickup and delivery problem with time windows: matheuristics and new instances (Q2664415) (← links)
- A relax-and-fix and fix-and-optimize algorithm for a maritime inventory routing problem (Q2669624) (← links)
- Speeding Up Dynamic Shortest-Path Algorithms (Q2901004) (← links)
- (Q2917268) (← links)
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853) (← links)
- Survivable IP network design with OSPF routing (Q3418122) (← links)
- Estimating Clustering Indexes in Data Streams (Q3527252) (← links)
- A branch‐and‐price algorithm for the single‐path virtual network embedding problem (Q4638570) (← links)
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing (Q5318276) (← links)
- A biased random‐key genetic algorithm for the home health care problem (Q6146648) (← links)
- Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem (Q6446808) (← links)
