Fred Glover

51 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0001-6945-0438

Entanglement, Inc.

Publications

• Solving the Minimum Sum Coloring Problem: Alternative Models, Exact Solvers, and Metaheuristics — INFORMS Journal on Computing 2025
• Heuristic Search for Rank Aggregation with Application to Label Ranking — INFORMS Journal on Computing 2024
• Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search — INFORMS Journal on Computing 2024
• Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres — INFORMS Journal on Computing 2023
• A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets — INFORMS Journal on Computing 2022
• Unforeseen Consequences of “Tabu” Choices—A Retrospective — INFORMS Journal on Computing 2022
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking — INFORMS Journal on Computing 2020
• Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization — INFORMS Journal on Computing 2007
• DNA Sequencing—Tabu and Scatter Search Combined — INFORMS Journal on Computing 2004
• An Ejection Chain Approach for the Generalized Assignment Problem — INFORMS Journal on Computing 2004
• Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search — Management Science 1999
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory — INFORMS Journal on Computing 1999
• Adaptive Memory Tabu Search for Binary Quadratic Programs — Management Science 1998
• A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination — INFORMS Journal on Computing 1997
• Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP — Management Science 1997
• A NEW LEARNING APPROACH TO PROCESS IMPROVEMENT IN A TELECOMMUNICATIONS COMPANY — Production and Operations Management 1995
• Tabu Thresholding: Improved Search by Nonmonotonic Trajectories — ORSA Journal on Computing 1995
• Bandwidth Packing: A Tabu Search Approach — Management Science 1993
• Tabu Search—Part II — ORSA Journal on Computing 1990
• Tabu Search—Part I — ORSA Journal on Computing 1989
• New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures — Operations Research 1989
• A New Polynomially Bounded Shortest Path Algorithm — Operations Research 1985
• New Polynomial Shortest Path Algorithms and Their Computational Attributes — Management Science 1985
• A heuristic programming approach to the employee scheduling problem and some thoughts on “managerial robots” — Journal of Operations Management 1984
• A New Optimization Method for Large Scale Fixed Charge Transportation Problems — Operations Research 1981
• Letter to the Editor—Comments on a Note by Hatch on Network Algorithms — Operations Research 1978
• Generalized Networks: A Fundamental Computer-Based Planning Tool — Management Science 1978
• Surrogate Constraint Duality in Mathematical Programming — Operations Research 1975
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems — Management Science 1975
• Optimal Weighted Ancestry Relationships — Management Science 1974
• The Disjunctive-Facet Problem: Formulation and Solution Techniques — Operations Research 1974
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems — Management Science 1974
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program — Operations Research 1974
• The Generalized Lattice-Point Problem — Operations Research 1973
• Convexity Cuts and Cut Search — Operations Research 1973
• Concave Programming Applied to a Special Class of 0-1 Integer Programs — Operations Research 1973
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems — Operations Research 1973
• Technical Note—A Note on Zero-One Integer and Concave Programming — Operations Research 1972
• Basic Dual Feasible Solutions for a Class of Generalized Networks — Operations Research 1972
• Higher Order Tree Dual Approximation Methods for the Distribution Problem — Management Science 1972
• A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg — Operations Research 1971
• Flows in Arborescences — Management Science 1971
• An Intersection Cut from the Dual of the Unit Hypercube — Operations Research 1971
• Letter to the Editor—A Note on a Distribution Problem — Operations Research 1970
• A New Foundation for a Simplified Primal Integer Programming Algorithm — Operations Research 1968
• Surrogate Constraints — Operations Research 1968
• A Note on Linear Programming and Integer Feasibility — Operations Research 1968
• Letter to the Editor—Stronger Cuts in Integer Programming — Operations Research 1967
• Generalized Cuts in Diophantine Programming — Management Science 1966
• A Note on the Additive Algorithm of Balas — Operations Research 1965
• A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem — Operations Research 1965