| Publication | Date of Publication | Type |
|---|
| A random-key GRASP for combinatorial optimization | 2025-01-21 | Paper |
| A metaheuristic algorithm for large maximum weight independent set problems | 2025-01-15 | Paper |
| A biased random‐key genetic algorithm for the home health care problem | 2024-01-31 | Paper |
| 20 years of Greedy Randomized Adaptive Search Procedures with Path Relinking | 2023-12-19 | Paper |
| A light‐touch routing optimization tool (RoOT) for vaccine and medical supply distribution in Mozambique | 2023-11-23 | Paper |
| Efficient GRASP solution approach for the prisoner transportation problem | 2023-07-04 | Paper |
| A C++ application programming interface for co-evolutionary biased random-key genetic algorithms for solution and scenario generation | 2022-10-06 | Paper |
| New instances for maximum weight independent set from a vehicle routing application | 2021-11-08 | Paper |
| The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications | 2021-06-03 | Paper |
| Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs | 2020-11-04 | Paper |
| Hybrid algorithms for placement of virtual machines across geo-separated data centers | 2019-10-29 | Paper |
| Disjoint-Path Facility Location: Theory and Practice | 2019-09-12 | Paper |
| A biased random-key genetic algorithm for the tree of hubs location problem | 2017-11-09 | Paper |
| A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems | 2017-10-02 | Paper |
| Fast local search for the maximum independent set problem | 2017-04-04 | Paper |
| On the minimization of traffic congestion in road networks with tolls | 2017-03-07 | Paper |
| Hybrid method with CS and BRKGA applied to the minimization of tool switches problem | 2016-11-17 | Paper |
| A biased random key genetic algorithm for the field Technician scheduling problem | 2016-11-17 | Paper |
| A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering | 2016-11-10 | Paper |
| A biased random-key genetic algorithm for the capacitated minimum spanning tree problem | 2016-11-10 | Paper |
| A biased random-key genetic algorithm for the unequal area facility layout problem | 2016-10-06 | Paper |
| GRASP with Path-Relinking for Facility Layout | 2016-09-13 | Paper |
| Optimization by GRASP | 2016-08-10 | Paper |
| Multiobjective GRASP with path relinking | 2016-07-06 | Paper |
| Hybridizations of GRASP with path relinking for the far from most string problem | 2016-06-09 | Paper |
| A biased random-key genetic algorithm for single-round divisible load scheduling | 2016-05-18 | Paper |
| A biased random-key genetic algorithm for the minimization of open stacks problem | 2016-05-04 | Paper |
| A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm | 2015-09-28 | Paper |
| On the Far from Most String Problem, One of the Hardest String Selection Problems | 2015-06-04 | Paper |
| Improved heuristics for the regenerator location problem | 2015-02-25 | Paper |
| Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm | 2015-01-15 | Paper |
| Multi-start methods for combinatorial optimization | 2014-07-27 | Paper |
| An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling | 2014-05-15 | Paper |
| An edge-swap heuristic for generating spanning trees with minimum number of branch vertices | 2014-04-30 | Paper |
| A Python/C library for bound-constrained global optimization with continuous GRASP | 2013-06-28 | Paper |
| Correspondence of projected 3-D points and lines using a continuous GRASP | 2013-03-19 | Paper |
| Biased random-key genetic algorithms with applications in telecommunications | 2013-02-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3145802 | 2012-12-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3145804 | 2012-12-23 | Paper |
| A biased random-key genetic algorithm for the Steiner triple covering problem | 2012-11-30 | Paper |
| Experiments with LAGRASP heuristic for set \(k\)-covering | 2012-11-30 | Paper |
| Restart strategies for GRASP with path-relinking heuristics | 2012-11-30 | Paper |
| A parallel multi-population biased random-key genetic algorithm for a container loading problem | 2012-11-15 | Paper |
| Speeding up dynamic shortest-path algorithms | 2012-07-28 | Paper |
| GRASP with path relinking for three-index assignment | 2012-06-08 | Paper |
| Revised GRASP with path-relinking for the linear ordering problem | 2012-04-04 | Paper |
| GRASP with path-relinking for the generalized quadratic assignment problem | 2012-03-09 | Paper |
| GRASP with path relinking heuristics for the antibandwidth problem | 2011-11-21 | Paper |
| A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion | 2011-08-17 | Paper |
| Solving scalarized multi-objective network flow problems using an interior point method | 2011-05-20 | Paper |
| A biased random-key genetic algorithm for road congestion minimization | 2010-10-29 | Paper |
| Continuous GRASP with a local active-set method for bound-constrained global optimization | 2010-10-15 | Paper |
| Speeding up continuous GRASP | 2010-06-11 | Paper |
| GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem | 2009-12-10 | Paper |
| GRASP and path relinking for the max-min diversity problem | 2009-11-17 | Paper |
| An annotated bibliography of GRASP-Part II: Applications | 2009-08-28 | Paper |
| Solving systems of nonlinear equations with continuous GRASP | 2009-06-29 | Paper |
| A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs | 2009-06-23 | Paper |
| An annotated bibliography of GRASP – Part I: Algorithms | 2009-02-10 | Paper |
| A random key based genetic algorithm for the resource constrained project scheduling problem | 2008-10-08 | Paper |
| GRASP with path relinking for the weighted MAXSAT problem | 2008-06-20 | Paper |
| A genetic algorithm for the resource constrained multi-project scheduling problem | 2008-04-24 | Paper |
| A fast swap-based local search procedure for location problems | 2008-03-31 | Paper |
| TTT plots: a perl program to create time-to-target plots | 2008-01-25 | Paper |
| Global optimization by continuous grasp | 2007-11-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5294069 | 2007-07-23 | Paper |
| Parallel Greedy Randomized Adaptive Search Procedures | 2007-03-05 | Paper |
| Survivable IP network design with OSPF routing | 2007-02-02 | Paper |
| A hybrid multistart heuristic for the uncapacitated facility location problem | 2007-01-09 | Paper |
| Experimental and Efficient Algorithms | 2005-11-30 | Paper |
| A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing | 2005-09-22 | Paper |
| A hybrid genetic algorithm for the job shop scheduling problem | 2005-08-01 | Paper |
| Algorithm 815 | 2005-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3044359 | 2004-08-11 | Paper |
| A hybrid heuristic for the \(p\)-median problem | 2004-08-06 | Paper |
| Strong lower bounds for the prize collecting Steiner problem in graphs | 2004-08-06 | Paper |
| Randomized heuristics for the Max-Cut problem | 2004-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452968 | 2004-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452897 | 2004-03-07 | Paper |
| An annotated bibliography of network interior point methods | 2003-11-10 | Paper |
| A study of preconditioners for network interior point methods | 2003-04-27 | Paper |
| A GRASP with path-relinking for private virtual circuit routing | 2003-04-10 | Paper |
| A grasp for job shop scheduling | 2003-03-12 | Paper |
| Probability distribution of solution time in GRASP: an experimental investigation | 2002-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4550779 | 2002-09-04 | Paper |
| GRASP: An annoted bibliography | 2002-07-08 | Paper |
| Generating lower bounds for the prize collecting Steiner problem in graphs | 2001-10-24 | Paper |
| Local search with perturbations for the prize-collecting Steiner tree problem in graphs | 2001-10-14 | Paper |
| Piecewise linear time series estimation with GRASP | 2001-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4953319 | 2001-04-02 | Paper |
| A GRASP for the biquadratic assignment problem | 2001-02-22 | Paper |
| A greedy randomized adaptive search procedure for the feedback vertex set problem | 2001-02-09 | Paper |
| Finding independent sets in a graph using continuous multivariable polynomial formulations. | 2001-01-01 | Paper |
| Algorithm 797 | 2000-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945528 | 2000-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4945422 | 2000-09-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4355915 | 2000-08-06 | Paper |
| Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP | 2000-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247439 | 2000-04-19 | Paper |
| Algorithm 787: Fortran subroutines for approximate solution of maximum independent set problems using GRASP | 2000-01-03 | Paper |
| A parallel grasp for the Steiner tree problem in graphs using a hybrid local search strategy | 2000-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4224929 | 1999-01-17 | Paper |
| Computing approximate solutions of the maximum covering problem with GRASP | 1999-01-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375767 | 1998-06-02 | Paper |
| Algorithm 754: Fortran subroutines for approximate solution of dense quadratic assignment problems using GRASP | 1998-04-02 | Paper |
| Algorithm 769 | 1998-02-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4347852 | 1997-08-11 | Paper |
| A GRASP for graph planarization | 1997-08-07 | Paper |
| Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5688490 | 1997-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4895232 | 1997-01-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5687270 | 1996-12-11 | Paper |
| Designing and reporting on computational experiments with heuristic methods | 1996-09-01 | Paper |
| Greedy randomized adaptive search procedures | 1995-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4321558 | 1995-02-16 | Paper |
| A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set | 1995-01-12 | Paper |
| Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming | 1995-01-01 | Paper |
| Lower bounds for the quadratic assignment problem | 1994-12-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311919 | 1994-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4283447 | 1994-03-10 | Paper |
| A continuous approach to inductive inference | 1994-01-06 | Paper |
| An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks | 1993-12-06 | Paper |
| Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm | 1993-01-16 | Paper |
| An interior point algorithm to solve computationally difficult set covering problems | 1992-06-27 | Paper |
| A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension | 1990-01-01 | Paper |
| Computational experience with an interior point algorithm on the satisfiability problem | 1990-01-01 | Paper |
| A probabilistic heuristic for a computationally difficult set covering problem | 1989-01-01 | Paper |
| An implementation of Karmarkar's algorithm for linear programming | 1989-01-01 | Paper |
| A Program for Reliability Evaluation of Undirected Networks via Polygon-to-Chain Reductions | 1986-01-01 | Paper |
