Mauricio G. C. Resende

According to our database1, Mauricio G. C. Resende authored at least 160 papers between 1989 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
The Multi-Parent Biased Random-Key Genetic Algorithm with Implicit Path-Relinking and its real-world applications.
Eur. J. Oper. Res., 2021

2020
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs.
Oper. Res., 2020

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

2018
Random-Key Genetic Algorithms.
Proceedings of the Handbook of Heuristics., 2018

Biased Random-Key Genetic Progamming.
Proceedings of the Handbook of Heuristics., 2018

GRASP.
Proceedings of the Handbook of Heuristics., 2018

Preface: Recent advances in telecommunications networks planning and operation.
Networks, 2018

2017
A biased random-key genetic algorithm for the tree of hubs location problem.
Optim. Lett., 2017

A biased random-key genetic algorithm for scheduling heterogeneous multi-round systems.
Int. Trans. Oper. Res., 2017

A biased random key genetic algorithm applied to the electric distribution network reconfiguration problem.
J. Heuristics, 2017

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

A New Local Search for the p-Center Problem Based on the Critical Vertex Concept.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

2016
Heuristics for a hub location-routing problem.
Networks, 2016

A biased random-key genetic algorithm for the minimization of open stacks problem.
Int. Trans. Oper. Res., 2016

Hybridizations of GRASP with path relinking for the far from most string problem.
Int. Trans. Oper. Res., 2016

A biased random key genetic algorithm for the field technician scheduling problem.
Comput. Oper. Res., 2016

Hybrid method with CS and BRKGA applied to the minimization of tool switches problem.
Comput. Oper. Res., 2016

Biased Ranom-Key Genetic Algorithms: An Advanced Tutorial.
Proceedings of the Genetic and Evolutionary Computation Conference, 2016

2015
A C++application programming interface for biased random-key genetic algorithms.
Optim. Methods Softw., 2015

A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm.
J. Comb. Optim., 2015

A biased random-key genetic algorithm for single-round divisible load scheduling.
Int. Trans. Oper. Res., 2015

Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015

Multiobjective GRASP with Path Relinking.
Eur. J. Oper. Res., 2015

A biased random-key genetic algorithm for the unequal area facility layout problem.
Eur. J. Oper. Res., 2015

Biased Random-Key Genetic Algorithms for the Winner Determination Problem in Combinatorial Auctions.
Evol. Comput., 2015

A biased random-key genetic algorithm for the capacitated minimum spanning tree problem.
Comput. Oper. Res., 2015

A biased random-key genetic algorithm for wireless backhaul network design.
Appl. Soft Comput., 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

2014
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices.
Optim. Lett., 2014

Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm.
J. Glob. Optim., 2014

Preface.
J. Comb. Optim., 2014

Randomized heuristics for the family traveling salesperson problem.
Int. Trans. Oper. Res., 2014

An extended Akers graphical method with a biased random-key genetic algorithm for job-shop scheduling.
Int. Trans. Oper. Res., 2014

Improved heuristics for the regenerator location problem.
Int. Trans. Oper. Res., 2014

GRASP with Path-Relinking for the Maximum Contact Map Overlap Problem.
Proceedings of the Learning and Intelligent Optimization, 2014

Evolutionary algorithms for overlapping correlation clustering.
Proceedings of the Genetic and Evolutionary Computation Conference, 2014

2013
Hybridizations of GRASP with Path-Relinking.
Proceedings of the Hybrid Metaheuristics, 2013

A Python/C library for bound-constrained global optimization with continuous GRASP.
Optim. Lett., 2013

Randomized heuristics for handover minimization in mobility networks.
J. Heuristics, 2013

Multi-start methods for combinatorial optimization.
Eur. J. Oper. Res., 2013

A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering.
Comput. Oper. Res., 2013

Special issue of Computers and Operations Research: GRASP with Path Relinking: Developments and applications.
Comput. Oper. Res., 2013

Design and optimization of fiber optic small-cell backhaul based on an existing fiber-to-the-node residential access network.
IEEE Commun. Mag., 2013

Automatic Tuning of GRASP with Evolutionary Path-Relinking.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Hybrid Metaheuristics for the Far From Most String Problem.
Proceedings of the Hybrid Metaheuristics - 8th International Workshop, 2013

Biased random-key genetic algorithm for linearly-constrained global optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem.
Proceedings of the Genetic and Evolutionary Computation Conference, 2013

Biased random-key genetic algorithm for nonlinearly-constrained global optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2013

2012
A biased random-key genetic algorithm for the Steiner triple covering problem.
Optim. Lett., 2012

Guest Editorial: Thematic Issue on "Memetic Algorithms: Theory and applications in OR/MS".
Memetic Comput., 2012

Path-relinking intensification methods for stochastic local search algorithms.
J. Heuristics, 2012

Fast local search for the maximum independent set problem.
J. Heuristics, 2012

A parallel multi-population biased random-key genetic algorithm for a container loading problem.
Comput. Oper. Res., 2012

Parallel hybrid heuristics for the permutation flow shop problem.
Ann. Oper. Res., 2012

2011
GRASP: basic components and enhancements.
Telecommun. Syst., 2011

Restart strategies for GRASP with path-relinking heuristics.
Optim. Lett., 2011

Experiments with LAGRASP heuristic for set <i>k</i>-covering.
Optim. Lett., 2011

GRASP with path relinking heuristics for the antibandwidth problem.
Networks, 2011

A biased random-key genetic algorithm for routing and wavelength assignment.
J. Glob. Optim., 2011

A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem.
J. Comb. Optim., 2011

Revised GRASP with path-relinking for the linear ordering problem.
J. Comb. Optim., 2011

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

Correspondence of projected 3-D points and lines using a continuous GRASP.
Int. Trans. Oper. Res., 2011

GRASP with path-relinking for the generalized quadratic assignment problem.
J. Heuristics, 2011

A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem.
J. Heuristics, 2011

Biased random-key genetic algorithms for combinatorial optimization.
J. Heuristics, 2011

BRKGA Algorithm for the Capacitated Arc Routing Problem.
Proceedings of the XXXVII Latin American Computer Conference - Selected Papers, 2011

An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

GRASP with Path-Relinking for Data Clustering: A Case Study for Biological Data.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

Disjoint-Path Facility Location: Theory and Practice.
Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

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

Continuous GRASP with a local active-set method for bound-constrained global optimization.
J. Glob. Optim., 2010

Solving scalarized multi-objective network flow problems using an interior point method.
Int. Trans. Oper. Res., 2010

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem.
Eur. J. Oper. Res., 2010

Speeding up continuous GRASP.
Eur. J. Oper. Res., 2010

GRASP and path relinking for the max-min diversity problem.
Comput. Oper. Res., 2010

Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm.
Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

2009
Hybrid GRASP Heuristics.
Proceedings of the Foundations of Computational Intelligence, 2009

Graph Planarization.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Greedy Randomized Adaptive Search Procedures.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

Feedback Set Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

An annotated bibliography of GRASP-Part II: Applications.
Int. Trans. Oper. Res., 2009

An annotated bibliography of GRASP - Part I: Algorithms.
Int. Trans. Oper. Res., 2009

A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs.
Discret. Appl. Math., 2009

A random key based genetic algorithm for the resource constrained project scheduling problem.
Comput. Oper. Res., 2009

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

A genetic algorithm for the resource constrained multi-project scheduling problem.
Eur. J. Oper. Res., 2008

Efficient Implementations of Heuristics for Routing and Wavelength Assignment.
Proceedings of the Experimental Algorithms, 7th International Workshop, 2008

2007
TIE breaking: tunable interdomain egress selection.
IEEE/ACM Trans. Netw., 2007

Global optimization by continuous grasp.
Optim. Lett., 2007

TTT plots: a perl program to create time-to-target plots.
Optim. Lett., 2007

Survivable IP network design with OSPF routing.
Networks, 2007

Streaming cache placement problems: complexity and algorithms.
Int. J. Comput. Sci. Eng., 2007

A fast swap-based local search procedure for location problems.
Ann. Oper. Res., 2007

2006
GRASP with path relinking for the weighted MAXSAT problem.
ACM J. Exp. Algorithmics, 2006

A hybrid multistart heuristic for the uncapacitated facility location problem.
Eur. J. Oper. Res., 2006

Optimization Problems in Multicast Tree Construction.
Proceedings of the Handbook of Optimization in Telecommunications, 2006

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

GRASP with Path Relinking for Three-Index Assignment.
INFORMS J. Comput., 2005

A hybrid genetic algorithm for the job shop scheduling problem.
Eur. J. Oper. Res., 2005

GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem.
Proceedings of the Experimental and Efficient Algorithms, 4th InternationalWorkshop, 2005

2004
A Hybrid Heuristic for the p-Median Problem.
J. Heuristics, 2004

Strong lower bounds for the prize collecting Steiner problem in graphs.
Discret. Appl. Math., 2004

An evolutionary algorithm for manufacturing cell formation.
Comput. Ind. Eng., 2004

GRASP with Path-Relinking for the Quadratic Assignment Problem.
Proceedings of the Experimental and Efficient Algorithms, Third International Workshop, 2004

2003
Parallel GRASP with path-relinking for job shop scheduling.
Parallel Comput., 2003

An annotated bibliography of network interior point methods.
Networks, 2003

A GRASP with path-relinking for private virtual circuit routing.
Networks, 2003

A Study of Preconditioners for Network Interior Point Methods.
Comput. Optim. Appl., 2003

GRASP: Procedimientos de búsquedas miopes aleatorizados y adaptativos.
Inteligencia Artif., 2003

On the Implemention of a Swap-Based Local Search Procedure for the p-Median Problem.
Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, 2003

Greedy Randomized Adaptive Search Procedures.
Proceedings of the Handbook of Metaheuristics, 2003

2002
Randomized heuristics for the Max-Cut problem.
Optim. Methods Softw., 2002

A Genetic Algorithm for the Weight Setting Problem in OSPF Routing.
J. Comb. Optim., 2002

Probability Distribution of Solution Time in GRASP: An Experimental Investigation.
J. Heuristics, 2002

Massive Quasi-Clique Detection.
Proceedings of the LATIN 2002: Theoretical Informatics, 2002

2001
Algorithm 815: FORTRAN subroutines for computing approximate solutions of feedback set problems using GRASP.
ACM Trans. Math. Softw., 2001

Local search with perturbations for the prize-collecting Steiner tree problem in graphs.
Networks, 2001

Finding independent sets in a graph using continuous multivariable polynomial formulations.
J. Glob. Optim., 2001

Multichannel Optical Networks: Theory and Practice.
J. Comb. Optim., 2001

"Mobile Networks and Computing".
J. Comb. Optim., 2001

Generating lower bounds for the prize collecting Steiner problem in graphs.
Electron. Notes Discret. Math., 2001

Piecewise Linear Time Series Estimation with GRASP.
Comput. Optim. Appl., 2001

Reactive GRASP with path relinking for channel assignment in mobile phone networks.
Proceedings of the 5th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2001), 2001

2000
A truncated primal-infeasible dual-feasible network interior point method.
Networks, 2000

A Parallel Grasp for the Steiner Tree Problem in Graphs Using a Hybrid Local Search Strategy.
J. Glob. Optim., 2000

Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP.
Discret. Appl. Math., 2000

A GRASP for Computing Approximate Solutions for the Three-Index Assignment Problem.
Proceedings of the Parallel and Distributed Processing, 2000

1999
Algorithm 797: Fortran subroutines for approximate solution of graph planarization problems using GRASP.
ACM Trans. Math. Softw., 1999

A GRASP for frequency assignment in mobile radio networks.
Proceedings of the Mobile Networks and Computing, 1999

Frequency Assignment Problems.
Proceedings of the Handbook of Combinatorial Optimization, 1999

Feedback Set Problems.
Proceedings of the Handbook of Combinatorial Optimization, 1999

1998
Algorithm 787: Fortran Subroutines for Approximate Solution of Maximum Independent Set Problems Using GRASP.
ACM Trans. Math. Softw., 1998

A Greedy Randomized Adaptive Search Procedure for the Feedback Vertex Set Problem.
J. Comb. Optim., 1998

Computing Approximate Solutions of the Maximum Covering Problem with GRASP.
J. Heuristics, 1998

A GRASP for the biquadratic assignment problem.
Eur. J. Oper. Res., 1998

On maximum clique problems in very large graphs.
Proceedings of the External Memory Algorithms, 1998

1997
Algorithm 769: Fortran Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw., 1997

Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem.
SIAM J. Optim., 1997

A GRASP for graph planarization.
Networks, 1997

Greedy randomized adaptive search procedures for the Steiner problem in graphs.
Proceedings of the Randomization Methods in Algorithm Design, 1997

1996
Algorithm 754: Fortran Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP.
ACM Trans. Math. Softw., 1996

A Parallel GRASP for MAX-SAT Problems.
Proceedings of the Applied Parallel Computing, 1996

Approximate solution of weighted MAX-SAT problems using GRASP.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996

1995
Greedy Randomized Adaptive Search Procedures.
J. Glob. Optim., 1995

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.
Oper. Res., 1995

Designing and reporting on computational experiments with heuristic methods.
J. Heuristics, 1995

Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP.
Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1995

1994
A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set.
Oper. Res., 1994

Lower bounds for the quadratic assignment problem.
Ann. Oper. Res., 1994

1993
An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks.
SIAM J. Optim., 1993

A GRASP for satisfiability.
Proceedings of the Cliques, 1993

A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem.
Proceedings of the Quadratic Assignment and Related Problems, 1993

1992
A continuous approach to inductive inference.
Math. Program., 1992

1991
An interior point algorithm to solve computationally difficult set covering problems.
Math. Program., 1991

An Efficient Implementation of a Network Interior Point Method.
Proceedings of the Network Flows And Matching, 1991

1990
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension.
Math. Oper. Res., 1990

Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1989
An implementation of Karmarkar's algorithm for linear programming.
Math. Program., 1989

Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm.
INFORMS J. Comput., 1989


  Loading...