The following pages link to Mauricio G. C. Resende (Q226720):
Displaying 50 items.
- (Q167621) (redirect page) (← links)
- A biased random-key genetic algorithm for the unequal area facility layout problem (Q319725) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- Hybrid method with CS and BRKGA applied to the minimization of tool switches problem (Q342275) (← links)
- A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
- On the minimization of traffic congestion in road networks with tolls (Q513622) (← links)
- Fast local search for the maximum independent set problem (Q519101) (← links)
- A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
- A continuous approach to inductive inference (Q687090) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Continuous GRASP with a local active-set method for bound-constrained global optimization (Q708907) (← links)
- Computational experience with an interior point algorithm on the satisfiability problem (Q753688) (← links)
- GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
- A hybrid multistart heuristic for the uncapacitated facility location problem (Q858329) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- Speeding up continuous GRASP (Q976348) (← links)
- A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs (Q1025987) (← links)
- Solving systems of nonlinear equations with continuous GRASP (Q1026675) (← links)
- GRASP and path relinking for the max-min diversity problem (Q1038285) (← links)
- GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
- A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Computing approximate solutions of the maximum covering problem with GRASP (Q1273660) (← links)
- A greedy randomized adaptive search procedure for the feedback vertex set problem (Q1288478) (← links)
- A GRASP for the biquadratic assignment problem (Q1291786) (← links)
- Lower bounds for the quadratic assignment problem (Q1339141) (← links)
- A biased random-key genetic algorithm for the tree of hubs location problem (Q1676487) (← links)
- A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- An implementation of Karmarkar's algorithm for linear programming (Q1824551) (← links)
- A hybrid heuristic for the \(p\)-median problem (Q1826490) (← links)
- Strong lower bounds for the prize collecting Steiner problem in graphs (Q1827870) (← links)
- Probability distribution of solution time in GRASP: an experimental investigation (Q1850990) (← links)
- A study of preconditioners for network interior point methods (Q1868386) (← links)
- Designing and reporting on computational experiments with heuristic methods (Q1922625) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP (Q1962023) (← links)
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
- New instances for maximum weight independent set from a vehicle routing application (Q2241318) (← links)
- Multi-start methods for combinatorial optimization (Q2253534) (← links)
- Hybrid algorithms for placement of virtual machines across geo-separated data centers (Q2331587) (← links)
- A Python/C library for bound-constrained global optimization with continuous GRASP (Q2377221) (← links)
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195) (← links)
- Global optimization by continuous grasp (Q2458920) (← links)
