Fred Glover
Research Subjects
Fred Glover has a total of 132 co-authors. Here are the top co-authors by number of shared publications:
- Jin-Kao Hao
Department of Computer Science, LERIA Laboratory, University of Angers, Angers, France
21 shared publications - Gary Kochenberger
College of Business University of Colorado at Denver 80217 Denver CO USA
13 shared publications - Rafael Martí
University of Valencia
10 shared publications - César Rego
School of Business Administration, The University of Mississippi, University, MS, USA
8 shared publications - Bahram Alidaee
School of Business Administration, The University of Mississippi, University, USA
6 shared publications - Haibo Wang
Division of International Business and Technology Studies School of Business Texas A&M International University Laredo TX USA
6 shared publications
Latest Publications
- Open Access
- 24 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Advanced probabilistic tabu search for the fair max-min diversity problem
- 24 August 2026
- Published by Elsevier in Computers & Operations Research
- Vol. 196
Open AccessAdvanced probabilistic tabu search for the fair max-min diversity problem
- 29 April 2026
- Published by Springer Nature
- p. 306-326
The Next Stage of Evolutionary Computation in the Era of Agentic Generative AI
- 29 April 2026
- Published by Springer Nature
- p. 306-326
The Next Stage of Evolutionary Computation in the Era of Agentic Generative AI
- 17 December 2024
- Published by Springer Nature
- p. 1-26
QUBO: Quadratic Unconstrained Binary Optimization Problem
- 17 December 2024
- Published by Springer Nature
- p. 1-26
QUBO: Quadratic Unconstrained Binary Optimization Problem
- 1 January 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (1) , 39-60
Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security, and drug design. To solve the problem, we present a “reduce-solve-combine” memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers nine new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72371157, 61903144, 72031007]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0130 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0130 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- 1 January 2024
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 36 (1) , 39-60
Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security, and drug design. To solve the problem, we present a “reduce-solve-combine” memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers nine new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 72371157, 61903144, 72031007]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2022.0130 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0130 ). The complete IJOC Software and Data Repository is available at https://informsjoc.github.io/ .
- Open Access
- 23 November 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 243
Strategic oscillation tabu search for improved hierarchical graph drawing
- 23 November 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 243
Open AccessStrategic oscillation tabu search for improved hierarchical graph drawing
- 7 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm
- 7 September 2023
- Published by Elsevier in Expert Systems with Applications
- Vol. 237
Solving the incremental graph drawing problem by multiple neighborhood solution-based tabu search algorithm
- 23 August 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security and drug design. To solve the problem, we present a "reduce-solve-combine" memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers 9 new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem.
- 23 August 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search
This study considers a well-known critical node detection problem that aims to minimize a pairwise connectivity measure of an undirected graph via the removal of a subset of nodes (referred to as critical nodes) subject to a cardinality constraint. Potential applications include epidemic control, emergency response, vulnerability assessment, carbon emission monitoring, network security and drug design. To solve the problem, we present a "reduce-solve-combine" memetic search approach that integrates a problem reduction mechanism into the popular population-based memetic algorithm framework. At each generation, a common pattern mined from two parent solutions is first used to reduce the given problem instance, then the reduced instance is solved by a component-based hybrid neighborhood search that effectively combines an articulation point impact strategy and a node weighting strategy, and finally an offspring solution is produced by combining the mined common pattern and the solution of the reduced instance. Extensive evaluations on 42 real-world and synthetic benchmark instances show the efficacy of the proposed method, which discovers 9 new upper bounds and significantly outperforms the current state-of-the-art algorithms. Investigation of key algorithmic modules additionally discloses the importance of the proposed ideas and strategies. Finally, we demonstrate the generality of the proposed method via its adaptation to solve the node-weighted critical node problem.
- 1 July 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (4) , 725-746
Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres
This paper presents an effective perturbation-based thresholding search for two popular and challenging packing problems with minimal containers: packing N identical circles in a square and packing N identical spheres in a cube. Following the penalty function approach, we handle these constrained optimization problems by solving a series of unconstrained optimization subproblems with fixed containers. The proposed algorithm relies on a two-phase search strategy that combines a thresholding search method reinforced by two general-purpose perturbation operators and a container adjustment method. The performance of the algorithm is assessed relative to a large number of benchmark instances widely studied in the literature. Computational results show a high performance of the algorithm on both problems compared with the state-of-the-art results. For circle packing, the algorithm improves 156 best-known results (new upper bounds) in the range of [ ] and matches 242 other best-known results. For sphere packing, the algorithm improves 66 best-known results in the range of [ ], whereas matching the best-known results for 124 other instances. Experimental analyses are conducted to shed light on the main search ingredients of the proposed algorithm consisting of the two-phase search strategy, the mixed perturbation and the parameters. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 61703213 and 61933005]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.1290 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0004 ) at ( http://dx.doi.org/10.5281/zenodo.7579558 ).
- 1 July 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
- Vol. 35 (4) , 725-746
Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres
This paper presents an effective perturbation-based thresholding search for two popular and challenging packing problems with minimal containers: packing N identical circles in a square and packing N identical spheres in a cube. Following the penalty function approach, we handle these constrained optimization problems by solving a series of unconstrained optimization subproblems with fixed containers. The proposed algorithm relies on a two-phase search strategy that combines a thresholding search method reinforced by two general-purpose perturbation operators and a container adjustment method. The performance of the algorithm is assessed relative to a large number of benchmark instances widely studied in the literature. Computational results show a high performance of the algorithm on both problems compared with the state-of-the-art results. For circle packing, the algorithm improves 156 best-known results (new upper bounds) in the range of [ ] and matches 242 other best-known results. For sphere packing, the algorithm improves 66 best-known results in the range of [ ], whereas matching the best-known results for 124 other instances. Experimental analyses are conducted to shed light on the main search ingredients of the proposed algorithm consisting of the two-phase search strategy, the mixed perturbation and the parameters. History: Accepted by Erwin Pesch, Area Editor for Heuristic Search & Approximation Algorithms. Funding: This work was supported by the National Natural Science Foundation of China [Grants 61703213 and 61933005]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.1290 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0004 ) at ( http://dx.doi.org/10.5281/zenodo.7579558 ).
- 6 April 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (17) , 20346-20364
Multi-start local search algorithm based on a novel objective function for clustering analysis
- 6 April 2023
- Published by Springer Nature in Applied Intelligence
- Vol. 53 (17) , 20346-20364
Multi-start local search algorithm based on a novel objective function for clustering analysis
- 29 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Perturbation-based thresholding search for packing equal circles and spheres
The software and data in this repository are a snapshot of the software and data that were used in the research reported in the paper Perturbation-based thresholding search for packing equal circles and spheres by L.J Lai, J.K. Hao, R.B. Xiao, and F. Glover.
- 29 March 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in INFORMS Journal on Computing
Code and Data Repository for Perturbation-based thresholding search for packing equal circles and spheres
The software and data in this repository are a snapshot of the software and data that were used in the research reported in the paper Perturbation-based thresholding search for packing equal circles and spheres by L.J Lai, J.K. Hao, R.B. Xiao, and F. Glover.