Fred W. Glover | Academic Influence

Why Is Fred W. Glover Influential?

According to Wikipedia, Fred W. Glover is known for his contributions to the area of metaheuristics and for launching the computer-based optimization methodology of Tabu search and the associated evolutionary Scatter Search and Path Relinking algorithms. Glover's principal areas of research include the fields of analytics, artificial intelligence, machine learning and applied mathematics.

Fred W. Glover's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Papers

Tabu Search - Part II (5656)
Tabu Search - Part I (4242)
Future paths for integer programming and links to artificial intelligence (3898)
Handbook of Metaheuristics (1747)
New ideas in optimization (1445)
HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS (1358)
Tabu Search (1154)
Tabu Search: A Tutorial (1036)
A user's guide to tabu search (958)
In Modern Heuristic Techniques for Combinatorial Problems (943)
Fundamentals of Scatter Search and Path Relinking (825)
A Template for Scatter Search and Path Relinking (758)
IMPROVED LINEAR INTEGER PROGRAMMING FORMULATIONS OF NONLINEAR INTEGER PROBLEMS (672)
Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges (560)
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization (520)
Simulation optimization: a review, new developments, and applications (406)
Technical Note - Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program (355)
The feasibility pump (343)
Principles of scatter search (342)
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem (324)
Metaheuristics (313)
Simple but powerful goal programming models for discriminant problems (308)
The general employee scheduling problem. An integration of MS and AI (303)
Genetic algorithms and tabu search: Hybrids for optimization (296)
Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems (264)
New approaches for heuristic search: A bilateral linkage with artificial intelligence (246)
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees (246)
IMPROVED LINEAR PROGRAMMING MODELS FOR DISCRIMINANT ANALYSIS (241)
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms) (214)
EVALUATING ALTERNATIVE LINEAR PROGRAMMING MODELS TO SOLVE THE TWO-GROUP DISCRIMINANT PROBLEM (208)
Critical Event Tabu Search for Multidimensional Knapsack Problems (198)
The unconstrained binary quadratic programming problem: a survey (193)
Tabu search for the multilevel generalized assignment problem (191)
Traveling salesman problem heuristics: Leading methods, implementations and latest advances (189)
The Passenger-Mix Problem in the Scheduled Airlines (188)
Adaptive Memory Tabu Search for Binary Quadratic Programs (188)
Surrogate Constraint Duality in Mathematical Programming (188)
Scatter search and path relinking (182)
A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems (179)
Maximum matching in a convex bipartite graph (169)
Applications and Implementation (168)
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory (168)
Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems (160)
Scatter Search and Path Relinking: Advances and Applications (152)
An Ejection Chain Approach for the Generalized Assignment Problem (150)
Genetic algorithms and scatter search: unsuspected potentials (149)
Solving zero-one mixed integer programming problems using tabu search (149)
The alternating basis algorithm for assignment problems (149)
Network models in optimization and their applications in practice (148)
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem (143)
Analyzing and Modeling the Maximum Diversity Problem by Zero‐One Programming* (143)
AN ALL-INTEGER INTEGER PROGRAMMING ALGORITHM (136)
A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem (134)
New Ideas in Optimisation (125)
New Ejection Chain and Alternating Path Methods for Traveling Salesman Problems (124)
Artificial intelligence, heuristic frameworks and tabu search (124)
Generalized Networks: A Fundamental Computer-Based Planning Tool (123)
Tabu search methods for a single machine scheduling problem (122)
Bandwidth packing: a tabu search approach (120)
A cooperative parallel tabu search algorithm for the quadratic assignment problem (120)
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems (117)
An Integrated Production, Distribution, and Inventory Planning System (117)
A New Polynomially Bounded Shortest Path Algorithm (117)
Scatter Search and Path-Relinking: Fundamentals, Advances, and Applications (115)
Extensions of the Petal Method for Vehicle Routeing (114)
Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem (114)
A path relinking approach with ejection chains for the generalized assignment problem (114)
A NEW CLASS OF MODELS FOR THE DISCRIMINANT PROBLEM (114)
New advances and applications of combining simulation and optimization (113)
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories (113)
An improved version of the out-of-kilter method and a comparative study of computer codes (110)
Integrating optimization and simulation: research and practice (109)
Reducing the bandwidth of a sparse matrix with tabu search (108)
A New Optimization Method for Large Scale Fixed Charge Transportation Problems (107)
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models (106)
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms (105)
Tabu Search Fundamentals and Uses (104)
Multi-Start and Strategic Oscillation Methods - Principles to Exploit Adaptive Memory (103)
A unified modeling and solution framework for combinatorial optimization problems (103)
New advances for wedding optimization and simulation (101)
Surrogate Constraints (98)
The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems (98)
Augmented Threaded Index Method for Network Optimization. (96)
Construction heuristics for the asymmetric TSP (95)
Enhancements of Spanning Tree Labeling Procedures for Network Optimization. (92)
PROBABILISTIC AND PARAMETRIC LEARNING COMBINATIONS OF LOCAL JOB SHOP SCHEDULING RULES (92)
Heuristic algorithms for the maximum diversity problem (91)
A History of Metaheuristics (91)
The simplex SON algorithm for LP/embedded network problems (90)
Fine-tuning a tabu search algorithm with statistical tests (90)
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions (87)
Integrating target analysis and tabu search for improved scheduling systems (86)
Applying tabu search with influential diversification to multiprocessor scheduling (85)
Multi-neighborhood tabu search for the maximum weight clique problem (83)
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (83)
Tabu search for graph partitioning (83)
Mitigating disruptions in a multi-echelon supply chain using adaptive ordering (83)
Computational study of an improved shortest path algorithm (81)
Simulation-based optimization: practical introduction to simulation optimization (79)
Contributions of Professor William W. Cooper in Operations Research and Management Science (77)
One-pass heuristics for large-scale unconstrained binary quadratic problems (76)
Scatter search and star-paths: beyond the genetic metaphor (75)
Path relinking for unconstrained binary quadratic programming (75)
Notes and Communications RESOLVING CERTAIN DIFFICULTIES AND IMPROVING THE CLASSIFICATION POWER OF LP DISCRIMINANT ANALYSIS FORMULATIONS (75)
A hybrid metaheuristic approach to solving the UBQP problem (75)
A study of diversification strategies for the quadratic assignment problem (74)
Tabu search and finite convergence (74)
Solving the maximum edge weight clique problem via unconstrained quadratic programming (73)
Network Application in Industry and Government (72)
Diversification-driven tabu search for unconstrained binary quadratic problems (72)
Neighborhood analysis: a case study on curriculum-based course timetabling (72)
Simulation Optimization: Applications in Risk Management (72)
Parametric tabu-search for mixed integer programs (70)
Convexity Cuts and Cut Search (69)
Multi-objective Meta-heuristics for the Traveling Salesman Problem with Profits (69)
Multi-objective process design in multi-purpose batch plants using a Tabu Search optimization algorithm (68)
New advances and applications of combining simulation and optimization (67)
General Purpose Heuristics for Integer Programming—Part II (66)
Scatter Search to Generate Diverse MIP Solutions (66)
Enhancing Business Process Management with Simulation Optimization (64)
Interactive decision software and computer graphics for architectural and space planning (64)
New advances and applications for marrying simulation and optimization (64)
Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning (62)
Local Search and Metaheuristics (62)
New advances for wedding optimization and simulation (61)
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem (59)
Scatter Search and Path Relinking: Foundations and Advanced Designs (59)
Advances in analytics: Integrating dynamic data mining with simulation optimization (57)
IMPROVED COMPUTER-BASED PLANNING TECHNIQUES (57)
Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search (57)
The case for strategic oscillation (57)
New Polynomial Shortest Path Algorithms and Their Computational Attributes (57)
Least-cost network topology design for a new service (56)
A Multistart Scatter Search Heuristic for Smooth NLP and MINLP Problems (56)
On the equivalence of some generalized network problems to pure network problems (56)
Improved Computer-Based Planning Techniques. Part II (56)
Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs (55)
ID Walk: A Candidate List Strategy with a Simple Diversification Device (55)
Future of simulation optimization (54)
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem (54)
Solving Singly Constrained Transshipment Problems (53)
Cyber Swarm Algorithms - Improving particle swarm optimization using adaptive memory strategies (53)
A heuristic programming approach to the employee scheduling problem and some thoughts on “managerial robots” (52)
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization (52)
TSP Ejection Chains (51)
Solving large scale Max Cut problems via tabu search (50)
A hybrid metaheuristic approach for the capacitated arc routing problem (50)
Shortest path forest with topological ordering: An algorithm description in SDL (50)
General purpose heuristics for integer programming—Part I (49)
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (48)
Netform Modeling and Applications (47)
A New Foundation for a Simplified Primal Integer Programming Algorithm (47)
Probabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems (47)
Principles of Tabu Search (46)
Clustering of Microarray data via Clique Partitioning (46)
Letter to the Editor—Extensions of the Augmented Predecessor Index Method to Generalized Network Problems (45)
Using tabu search to solve the Steiner tree-star problem in telecommunications network design (43)
Finding local optima of high-dimensional functions using direct search methods (43)
Coloring by tabu branch and bound (43)
Aggregating diophantine equations (43)
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks (42)
Sequential and parallel path-relinking algorithms for the quadratic assignment problem (42)
Solving group technology problems via clique partitioning (41)
Hybrid scatter tabu search for unconstrained global optimization (41)
Transmission-Capacity Expansion for Minimizing Blackout Probabilities (41)
Probabilistic GRASP-Tabu Search algorithms for the UBQP problem (41)
A discrete optimization model for preserving biological diversity (40)
A tabu search based memetic algorithm for the maximum diversity problem (40)
Improved Computer-Based Planning Techniques, Part 1 (40)
The deterministic multi-item dynamic lot size problem with joint business volume discount (39)
Two algorithms for weighted matroid intersection (39)
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (38)
Strong formulations and cutting planes for designing digital data service networks (37)
Selecting Project Portfolios by Optimizing Simulations (37)
Data structures and ejection chains for solving large-scale traveling salesman problems (37)
The application of tabu search to the symmetric traveling salesman problem (37)
Adaptive Memory Projection Methods for Integer Programming (37)
Polyhedral annexation in mixed integer and combinatorial programming (36)
Multilevel cooperative search for the circuit/hypergraphpartitioning problem (36)
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequence-dependent setup costs and times (35)
A History of Metaheuristics (35)
Tutorial on Surrogate Constraint Approaches for Optimization in Graphs (35)
Simulation/optimization using "real-world" applications (35)
LINEAR PROGRAMMING AND STATISTICAL DISCRIMINATION THE LP SIDE (34)
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (34)
An Improved MIP Formulation for Products of Discrete and Continuous Variables (33)
Tabu search for dynamic routing communications network design (33)
Polyhedral convexity cuts and negative edge extensions (32)
Parametric Ghost Image Processes for Fixed-Charge Problems: A Study of Transportation Networks (32)
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move (32)
Layering strategies for creating exploitable structure in linear and integer programs (32)
Threshold assignment algorithm (32)
Finding Minimum Spanning Trees with a Fixed Number of Links at a Node (31)
A Tabu search based clustering algorithm and its parallel implementation on Spark (31)
Adaptive memory programming for constrained global optimization (31)
The Generalized Lattice-Point Problem (30)
Integer Programming over a Finite Additive Group (30)
An Intersection Cut from the Dual of the Unit Hypercube (30)
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs (30)
A scatter search approach for unconstrained continuous optimization (30)
Generating Cuts from Surrogate Constraint Analysis for Zero-One and Multiple Choice Programming (30)
DNA Sequencing - Tabu and Scatter Search Combined (29)
Optimal Weighted Ancestry Relationships (29)
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis (29)
Effective metaheuristic algorithms for the minimum differential dispersion problem (28)
Locating stepping-stone paths in distribution problems via the predecessor index method (28)
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs (28)
A new modeling and solution approach for the number partitioning problem (28)
Memetic Search for Identifying Critical Nodes in Sparse Graphs (28)
Technical Note - Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks (28)
Past, present and future of large scale transshipment computer codes and applications (27)
Backbone guided tabu search for solving the UBQP problem (27)
An evolutionary path relinking approach for the quadratic multiple knapsack problem (27)
EM323: a line search based algorithm for solving high-dimensional continuous non-linear optimization problems (27)
A computational study on the quadratic knapsack problem with multiple constraints (26)
Unidimensional Search for Solving Continuous High-Dimensional Optimization Problems (26)
Ejection chain and filter-and-fan methods in combinatorial optimization (26)
Surrogate constraint analysis-new heuristics and learning schemes for satisfiability problems (26)
Concave Programming Applied to a Special Class of 0-1 Integer Programs (26)
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently (26)
A o(n logn) algorithm for LP knapsacks with GUB constraints (26)
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity (26)
RECENT DEVELOPMENTS IN COMPUTER IMPLEMENTATION TECHNOLOGY FOR NETWORK FLOW ALGORITHMS (25)
A Note on Computational Simplifications in Solving Generalized Transportation Problems (25)
A simple and effective algorithm for the MaxMin diversity problem (25)
Tabu search - wellsprings and challenges (25)
An Overview of Tabu Search Approaches to Production Scheduling Problems (25)
Ejection chain and filter-and-fan methods in combinatorial optimization (25)
The lower bounded and partial upper bounded distribution model (24)
Scatter Search and Local Nlp Solvers: A Multistart Framework for Global Optimization (24)
OptFolio - a simulation optimization system for project portfolio planning (24)
Tabu search—Uncharted domains (23)
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks (23)
Strategic oscillation for the quadratic multiple knapsack problem (23)
3-B-2 A PATH RELINKING APPROACH FOR THE GENERALIZED ASSIGNMENT PROBLEM (23)
A Note on the Additive Algorithm of Balas (23)
Tabu search with strategic oscillation for the quadratic minimum spanning tree (23)
Tabu search and ejection chains—application to a node weighted version of the cardinality-constrained TSP (22)
Flows in Arborescences (22)
Optimization by ghost image processes in neural networks (22)
Dynamic strategies for branch and bound (22)
Cut search methods in integer programming (21)
A note on xQx as a modelling and solution framework for the Linear Ordering Problem (21)
Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem (21)
Basic Dual Feasible Solutions for a Class of Generalized Networks (20)
Creating balanced and connected clusters to improve service delivery routes in logistics planning (20)
A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection (20)
Exploiting nested inequalities and surrogate constraints (20)
New Optimization Models for Data Mining (20)
A tabu search algorithm for cohesive clustering problems (20)
A Tutorial on Formulating QUBO Models (19)
Parametric branch and bound (19)
Using the unconstrained quadratic program to model and solve Max 2-SAT problems (19)
New results on equivalent integer programming formulations (19)
Adaptive memory search for Boolean optimization problems (19)
Solving Dynamic Stochastic Control Problems in Finance Using Tabu Search with Variable Scaling (19)
Finding equivalent transportation formulations for constrained transportation problems (18)
RAMP for the capacitated minimum spanning tree problem (18)
A comparative study of formulations for a cross-dock door assignment problem (18)
Probabilistic Tabu Search for the Cross-Docking Assignment Problem (18)
Multilevel cooperative search: application to the circuit/hypergraph partitioning problem (18)
Efficient facility layout planning in a maximally planar graph model (17)
An ejection chain algorithm for the quadratic assignment problem (17)
Solution-based tabu search for the maximum min-sum dispersion problem (17)
Strategic oscillation for the capacitated hub location problem with modular links (17)
A New Alternating Basis Algorithm for Semi-Assignment Networks. (17)
Convexity cuts for multiple choice problems (16)
Logical testing for rule-base management (16)
Exterior Path Relinking for Zero-One Optimization (16)
The Generalized Alternating Path Algorithm for Transportation Problems. (16)
Mathematical Programming Models and Methods for the Journal Selection Problem (16)
Evolutionary Approaches to DNA Sequencing with Errors (16)
A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial (15)
THE OPTQUEST APPROACH TO CRYSTAL BALL SIMULATION OPTIMIZATION (15)
PITFALLS OF ROUNDING IN DISCRETE MANAGEMENT DECISION PROBLEMS (15)
A Study of Alternative Relaxation Approaches for a Manpower Planning Problem. (15)
An effective modeling and solution approach for the generalized independent set problem (15)
Dealing with repetitions in sequencing by hybridization (15)
A PSEUDO PRIMAL-DUAL INTEGER PROGRAMMING ALGORITHM. (15)
Portfolio optimization for capital investment projects (15)
Multiple-use land planning and conflict resolution by multiple objective linear programming (15)
A Study of Tabu Search for Coloring Random 3-Colorable Graphs Around the Phase Transition (14)
Local Search For The Bin Packing Problem (14)
The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems (14)
Comprehensive Computer Evaluation and Enhancement of Maximum Flow Algorithms. (14)
Solving Quadratic Knapsack Problems by Reformulation and Tabu Search: Single Constraint Case (14)
Surrogate Constraints in Integer Programming (14)
Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem (14)
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization - Part II: Exploiting Reaction and Resistance (14)
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination (14)
Generalized Cuts in Diophantine Programming (14)
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization (13)
Water Pump Scheduling System Using Scatter Search, Tabu Search and Neural Networks—The Case of Bouregreg Water System in Morocco (13)
A Primal Simplex Variant for the Maximum Flow Problem (13)
Solving the maximum vertex weight clique problem via binary quadratic programming (13)
Past, Present and Future of Development, Computational Efficiency, and Practical Use of Large Scale Transportation and Transhipment Computer Codes (13)
Solving the minimum sum coloring problem via binary quadratic programming (13)
A Netform System for Resource Planning in the U.S. Bureau of Land Management (13)
A filter-and-fan approach to the 2D HP model of the protein folding problem (13)
New Ideas and Applications of Scatter Search and Path Relinking (12)
A network-related nuclear power plant model with an intelligent branch-and-bound solution approach (12)
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems (12)
Classification by vertical and cutting multi-hyperplane decision tree induction (12)
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (11)
Advanced Optimization Methodology in the Oil and Gas Industry: The Theory of Scatter Search Techniques with Simple Examples (11)
Clustering-driven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem (11)
Alternating control tree search for knapsack/covering problems (11)
A Complementary Cyber Swarm Algorithm (11)
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem (11)
Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints (11)
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (11)
Tabu Search Background (11)
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables (11)
Tabu search candidate list strategies in scheduling (11)
An ejection chain algorithm for the quadratic assignment problem (11)
Backtracking based iterated tabu search for equitable coloring (11)
Aggregation of nonnegative integer-valued equations (10)
Tabu Search Principles (10)
A simple multi-wave algorithm for the uncapacitated facility location problem (10)
Optimization and system selection: simulation/optimization using "real-world" applications (10)
Solving Combinatorial Optimization Problems Via Reformulation and Adaptive Memory Metaheuristics (10)
Construction Heuristics and Domination Analysis for the Asymmetric TSP (10)
Letter to the Editor - Comments on a Note by Hatch on Network Algorithms (10)
A Network Augmenting Path Basis Algorithm for Transshipment Problems (10)
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 0-1 Integer Programming Problems (10)
Neighborhood Combination for Unconstrained Binary Quadratic Problems (10)
Candidate List and Exploration Strategies for Solving 0/1 Mip Problems Using a Pivot Neighborhood (9)
A Hybrid Improvement Heuristic for the Bin Packing Problem (9)
Resolution Search and Dynamic Branch-and-Bound (9)
A Study of Memetic Search with Multi-parent Combination for UBQP (9)
Tabu Search and Evolutionary Scatter Search for ‘Tree‐Star’ Network Problems, with Applications to Leased‐Line Network Design (9)
Infeasible/feasible search trajectories and directional rounding in integer programming (9)
Polynomial unconstrained binary optimisation - Part 2 (9)
A Note on Linear Programming and Integer Feasibility (9)
New results for aggregating integer-valued equations (9)
Designing effective improvement methods for scatter search: an experimental study on global optimization (9)
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming (9)
New concepts, methodologies and algorithms for business education and research in the 21st century (9)
Pseudo-Cut Strategies for Global Optimization (9)
Improved Labeling of L.P. Bases in Networks (9)
A learning-based path relinking algorithm for the bandwidth coloring problem (9)
Diversification-based learning in computing and optimization (9)
Intensification-driven tabu search for the minimum differential dispersion problem (8)
Foundation-penalty cuts for mixed-integer programs (8)
Multi-Start Tabu Search and Diversification Strategies for the Quadratic Assignment Problem (8)
Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks (8)
An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem (8)
Exploiting surrogate constraint analysis for fixing variables in both bounds for multidimensional knapsack problems (8)
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints (8)
AN ALGORITHM FOR SOLVING THE LINEAR INTEGER PROGRAMMING PROBLEM OVER A FINITE ADDITIVE GROUP, WITH EXTENSIONS TO SOLVING GENERAL LINEAR AND CERTAIN NONLINEAR INTEGER PROBLEMS (8)
Iterated Local Search (8)
New Advances in the Solution of Large-Scale Network and Network-Related Problems. (8)
A Note on Finding All Shortest Paths (8)
Second-order cover inequalities (8)
Exact solutions to generalized vertex covering problems: a comparison of two models (8)
A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem (7)
Compact LP bases for a class of IP problems (7)
A learning-based memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading (7)
Inequalities and Target Objectives for Metaheuristic Search - Part I: Mixed Binary Optimization (7)
CREATING NETWORK STRUCTURE IN LP'S (7)
A Strongly Convergent Primal Algorithm for Generalized Networks. (7)
Capsule View of Future Developments on Large Scale Network and Network-Related Problems (7)
Teams of Global Equilibrium Search Algorithms for Solving the Weighted Maximum Cut Problem in Parallel (7)
New Heuristics and Adaptive Memory Procedures for Boolean Optimization Problems (7)
GRASP WITH EXTERIOR PATH RELINKING FOR DIFFERENTIAL DISPERSION MINIMIZATION (7)
Integrative Population Analysis for Better Solutions to Large-Scale Mathematical Programs (7)
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (7)
A study of two evolutionary/tabu search approaches for the generalized max-mean dispersion problem (7)
Exact, Heuristic and Metaheuristic Methods for Confidentiality Protection by Controlled Tabular Adjustment (7)
Adaptive pattern search for large-scale optimization (6)
Multi-wave algorithms for metaheuristic optimization (6)
Mathematical Optimization--A Successful Tool for Logistics Problems. (6)
Pseudo-centroid clustering (6)
A Comparison of Computation Times for Various Starting Procedures, Basis Change Criteria, and Solution Algorithms for Distribution Problems (6)
Doubly-rooted stem-and-cycle ejection chain algorithm for the asymmetric traveling salesman problem (6)
The 3-2-3, Stratified Split and Nested Interval Line Search Algorithms (6)
Path Relinking for Bandwidth Coloring Problem (6)
A mixed-integer programming approach to the clustering problem (6)
A Novel Mixed Integer Linear Programming Model for Clustering Relational Networks (6)
A New Optimization Methodology for Portfolio Management (6)
Tabu Search Applications (6)
A New Computer-Based Planning Tool. (6)
Finite Convergence of Tabu Search (6)
A Policy Evaluation Model and Prototype Computer-Assisted Policy Evaluation System for Naval Personnel Management. (6)
Modeling and Solving Network Problems (6)
Higher Order Tree Dual Approximation Methods for the Distribution Problem (6)
Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems (6)
An extended abstract of an indepth algorithmic and computational study for maximum flow problems (6)
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (6)
Optimizing diversity for engineering management (5)
An Experimental Evaluation of Ejection Chain Algorithms for the Traveling Salesman Problem (5)
A chromatic scheduling model with costs (5)
Technical Note - A Note on Zero-One Integer and Concave Programming (5)
Adaptive Memory Programming for Global Optimization (5)
Letter to the Editor - A Note on a Distribution Problem (5)
A Filter-and-Fan Approach to the 2 D Lattice Model of the Protein Folding Problem (5)
A comparison of pivot selection rules for primal simplex based network codes (5)
Further Extension of the TSP Assign Neighborhood (5)
Sequential and parallel path-relinking algorithms for the quadratic assignment problem : Advanced heuristics in transportation and logistics (5)
Tabu search for 0/1 mixed integer programming problems (5)
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection (5)
Interactive decision software and computer graphics for architectural and space planning (5)
A note on computational studies for solving transportation problems (5)
TABU SEARCH: Effective Strategies for Hard Problems in Analytics and Computational Science * (5)
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures (4)
Resort development: a network-related model for optimizing sites and visits. (4)
Bi-objective Optimization of Biclustering with Binary Data (4)
A Note on Admissible Exchanges in Spanning Trees (4)
Network Relaxations and Lower Bounds for Multiple Choice Problems (4)
A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization (4)
An Adaptive Memory Procedure for Continuous Optimization (4)
Simulation Optimization: Improving decisions under uncertainty (4)
Inequalities for mixed integer programs with structure (4)
Principles and Strategies of Tabu Search (4)
Scatter PSO - A more effective form of Particle Swarm Optimization (4)
Improved convexity cuts for lattice point problems (4)
Tabu Search Foundations: Longer Term Memory (4)
Binary Unconstrained Quadratic Optimization Problem (4)
Improved Classification and Discrimination by Successive Hyperplane and Multi-Hyperplane Separation (4)
A NEW LEARNING APPROACH TO PROCESS IMPROVEMENT IN A TELECOMMUNICATIONS COMPANY (4)
The Disjunctive-Facet Problem: Formulation and Solution Techniques (4)
A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg (3)
THE KNAPSACK PROBLEM: SOME RELATIONS FOR AN IMPROVED ALGORITHM (3)
Network Versus Linear Programming Algorithms and Implementations (3)
Intensification, Diversification and Learning in metaheuristic optimization (3)
New assignment-based neighborhoods for traveling salesman and routing problems (3)
f-Flip strategies for unconstrained binary quadratic programming (3)
Integrating modeling, algorithm design, and computational implementation to solve a large-scale nonlinear mixed integer programming problem (3)
Reducing the Size of Some IP Formulations by Substitution (3)
A framework for the optimization and analysis of agent-based models (3)
Satisfiability Data Mining for Binary Data Classification Problems (3)
Panel: simulation optimization: future of simulation optimization (3)
OptQuest software tutorial: portfolio optimization for capital investment projects (3)
Chvatal-Gomory-tier cuts for general integer programs (3)
A Specification of Trusted NFS (TNFS) Protocol Extensions (3)
A matheuristic for a telecommunication network design problem with traffic grooming (3)
A Barge Sequencing Heuristic (3)
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange (3)
A Multicriteria Stratification Framework for Uncertainty and Risk Analysis (3)
A One-Pass Algorithm to Determine a Dual Feasible Basic Solution for a Class of Capacitated Generalized Networks. (3)
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (3)
THE EXPLODING DOMAIN OF SIMULATION OPTIMIZATION (3)
Annals of Optimization Strategic Workforce Optimization : Ensuring Workforce Readiness with OptForce (2)
A Doubly-Rooted Stem-and-Cycle Ejection Chain Algorithm for Asymmetric Traveling Salesman Problems (2)
CONVERGENT TABU SEARCH FOR OPTIMAL PARTITIONING (2)
The 2-quasi-greedy algorithm for cardinality constrained matroid bases (2)
A practitioner's guide to the state of large scale network and network-related problems (2)
Modeling international loan portfolios through Linear Programming Discriminant Analysis (2)
Diversification methods for zero-one optimization (2)
Introduction to special xQx issue (2)
Polynomial unconstrained binary optimisation - Part 1 (2)
A STUDY OF THE ALL-INTEGER, INTEGER PROGRAMMING ALGORITHM (2)
A note on specialized versus unspecialized methods for maximum‐flow problems (2)
Special Tabu Search Topics (2)
Linear programming for weighted deviation problems using compact basis techniques (2)
Coupling optimization and statistical analysis with simulation models (2)
A modeling/solution approach for optimal deployment of a weapons arsenal (2)
Letter to the Editor - Stronger Cuts in Integer Programming (2)
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (2)
Integrating modeling, algorithm design, and computational implementation to solve a large-scale non-linear mixed integer programming problem (2)
FACES OF AN INTEGER POLYHEDRON FOR CYCLIC GROUPS - PART I. (2)
An Overview of Meta-Analytics: The Promise of Unifying Metaheuristics and Analytics (2)
Theory and Methodology Construction heuristics for the asymmetric TSP (1)
Combining solutions of the optimum satisfiability problem using evolutionary tunneling (1)
Working Paper Series HEARIN CENTER FOR ENTERPRISE SCIENCE (1)
Equivalence of Boolean Constrained Transportation Problems to Transportation Problems (1)
AN EXTENSION OF THE BOUND ESCALATION METHOD FOR INTEGER PROGRAMMING: A PSEUDO PRIMAL-DUAL ALGORITHM OF THE GOMORY ALL-INTEGER VARIETY (1)
A NOTE ON SOME STOCHASTIC APPROACHES TO NONSTOCHASTIC DISCRETE PROGRAMMING. (1)
Tabu Search Foundations: Short Term Memory (1)
A Reconstructive Evolutionary Metaheuristic for the Vertex Coloring Problem (1)
A Self-Organizing Extreme-Point Tabu-Search Algorithm for Fixed Charge Network Problems with Extensions (1)
A class of multi-level balanced Foundation-Penalty cuts for mixed-integer programs (1)
Adaptive Memory Search Guidance for Satisfiability Problems (1)
A Royal Road to Combinatorial Optimization ( ? )-The 0-1 Quadratic Programming Problem (1)
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming (1)
Simulation Optimization in Risk Management (1)
PROBABILISTIC TABU SEARCH FORTELECOMMUNICATIONS (1)
New relationships for multi-neighborhood search for the minimum linear arrangement problem (1)
TABU SEARCH HEURISTICS FORDESIGNING A STEINER TREE BASEDDIGITAL LINE (1)
SEARCH-REDUCTION TESTS FOR A COMBINATORIAL PRODUCTION SEQUENCING ALGORITHM (1)
FINE-TUNING A TABU SEARCHALGORITHM WITH STATISTICAL (1)
A Study of Memetic Search with Multi-Parent Crossover for UBQP (1)
1 A Novel Approach to Classification in Financial Applications (1)
A Simple Criterion for a Graph to have a Perfect Matching (1)
A Linear Programming/Network Model for Vegetation Allocation (1)
Local Search and Metaheuristics for the Traveling Salesman Problem1 (1)
An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (1)
Analysis on the Implementation of Efficient Heuristic Algorithms for the Traveling Salesman Problem (1)
In Memory of Darwin Klingman: A Tribute to an Esteemed Colleague and Friend (1)
Exploiting Local Optimality in Metaheuristic Search (1)
A HYBRID IMPROVEMENT HEURISTIC FOR THE BINPACKING (1)
Linkages with artificial intelligence (1)
A HYBRID-DUAL INTEGER PROGRAMMING ALGORITHM (1)
Scenario-Based Risk Management and Simulation Optimization† (1)
Metaheuristic Agent Processes (MAPS) (1)
Tabu Search Foundations: Additional Aspects of Short Term Memory (1)
Some Recent Practical Misconceptions about the State of the Art of Network Algorithms. (1)
Performance Comparison of Sphere Decoding and Global Search Algorithm based Multiuser Detectors for MC-CDMA system under Clipping Noise (0)
Appendix A: Linear Programming (0)
APPLICATION OF A BIP CONSTRAINED OPTIMIZATION MODEL COMBINED WITH NASA's ATLAS MODEL TO OPTIMIZE THE SOCIETAL BENEFITS OF THE USA's INTERNATIONAL SPACE EXPLORATION AND UTILIZATION INITIATIVE OF 1/14/04 (0)
Surrogate Branching : Parametric Relaxation for Mixed Integer Optimization (0)
Quantum Bridge Analytics II: Network Optimization and Combinatorial Chaining for Asset Exchange (0)
Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange (0)
Hotel Classification Using Meta-Analytics: A Case Study with Cohesive Clustering (0)
An 0(n(log n + log m)) Algorithm for LP Knapsacks with GUB Constraints. (0)
Important Practical Misconceptions of Optimizing Large Scale Assignment and Transportation Problems (0)
Additional Pure Network Formulation Techniques (0)
Modeling and Solution Procedures for Diversity Maximization (0)
AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT (0)
Netforms with Discrete Requirements (0)
Appendix B: Decision Support Systems for Network Models (0)
Resolution Search and Dynamic Branch-and- Bound Saïd Hanafi (0)
IMPROVED COMPUTER-BASED PLANNING TECHNIQUES . PART i r t (0)
Scenario-based Risk Management and Simulation Optimization Contributed to the Wiley Encyclopedia of Quantitative Risk Assessment By: (0)
Errata: A chromatic scheduling model with costs (0)
The AID Method for Global Optimization (0)
Intensi cation-driven tabu search for the minimum di erential dispersion problem (0)
Tabu Search in Integer Programming (0)
COMPUTER BASED DECISION SUPPORT SYSTEM FOR AIR TERMINAL OVERLOAD MANAGEMENT (0)
^ AD-763 385 IMPROVED CONVEXITY CUTS FOR LATTICE POINT PROBLEMS (0)
Competitive location under proportional choice: 1-suboptimal points on networks (0)
Tabu search approaches for facility layout planning (0)
CCS 241 IMPROVED BOUNDS FOR A CLASS OF 0-1 INTEGER PROGRAMS USING COMBINED SURROGATE-LAGRANGEAN TECHNIQUES by Fred Glover (0)
Flows in Arborescences*t (0)
Working Paper Series HEARIN CENTER FOR ENTERPRISE SCIENCE HCES-03-02 Foundation-Penalty Cuts for Mixed-Integer Programs (0)
5. Concluding Remarks 6. Acknowledgement (0)
Appendix C: Selected Readings (0)
Tabu search andnite convergence (0)
Working Paper Series HEARIN CENTER FOR ENTERPRISE SCIENCE HCES-04-02 Data Structure and Ejection Chains for Solving Large-Scale Traveling Salesman Problems by Dorabela (0)
Wiley Encyclopedia of Operations Research and Management Science Simulation Optimization in Risk Management (0)
Faces of the Gomory polyhedron for cyclic groups (0)
APPLICATION TO THE EFFICIENT SOLUTION OF TWO OPTIMIZATION PROBLEMS ON GRAPHS by (0)
MODELING COMBINATORIAL MATHEMATICAL PROGRAMMING PROBLEMS BY NETFORMS: AN ILLUSTRATIVE APPLICATION (0)
On convergence of scatter search and star paths with directional rounding for 0–1 mixed integer programs (0)
An Integrated Production, Distribution, Ai~d Inventory Planning System Long-range Planning Summary (0)
An extreme-point tabu-search algorithm for fixed-charge network problems (0)
Code development and computation testing on network problems (0)
TABU SEARCH – UNCHARTED DOMAINS 1 (0)
Preface to the 2nd Special Issue on metaheuristics in network optimization (0)
Netform Origins and Uses: Why Modeling and Netforms are Important (0)
Today's advances and tomorrow's challenges (0)
The Singularly Constrained Generalized Network Problem (0)
Logical testing for new approaches to mathematical programming modeling and analysis (0)
Multilevel Cooperative Sear h for theCir uit / Hypergraph Partitioning (0)
First facets of the octahedron (0)
Machines who manage-harnessing the combinatoric explosion (0)
A Note on Exchanges in Matroid Bases (0)
Penalty Cuts for GUB-Constrained Mixed Integer Programs (0)
Tabu Search for the Matrix Bandwidth Minimization (0)
Ejection Chains Filter and Fan Traveling Salesman Vehicle Routing Crew Scheduling Quadratic Assignment Capacitated Minimum Spanning Tree Facility Location Protein Folding Job Shop Scheduling (0)
Dynamic Network Models (0)
Working Paper Series HEARIN CENTER FOR ENTERPRISE SCIENCE HCES-04-03 Surrogate Branching Methods for Mixed Integer Programming (0)
A First Level Scatter Search Implementation for Solving the Steiner Ring Problem in Telecommunications Network Design (0)
Welcome Message from Program Chair (0)
A generalized recursive algorithm for a class of non‐stationary regeneration (scheduling) problems (0)
Equivalence of Generalized Network and Generalized Transportation Problems (0)
Connections, Hybrid Approaches and Learning (0)
Fundamental Models for Pure Networks (0)
Rejoinder on: Tabu search tutorial. A Graph Drawing Application (0)
The combinatoric explosion: a reassessment (0)
Integrating tabu search and VLSN (0)
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers (0)
Neglected Tabu Search Strategies (0)
NEW ALGORITHMS AND CUTTING PLANE CONSTRAINTS FOR THE SOLUTION OF DIOPHANTINE LINEAR PROGRAMS. (0)
Probabilistic Methods for Global Optimization in Continuous Variables. (0)
Focal distance tabu search (0)
Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems (0)
Improved Bounds for a Class of 0-1 Integer Programs Using Combined Surrogate-Lagrangean Techniques (0)
Application of a BIP Constrained Optimization Mode... (0)
A Class of Parametric Tree-Based Clustering Methods (0)
m etaheuristic s earch with i nequalities and t arget o bjectives for m ixed binary o ptimization Part i (0)
Multilevel cooperative search problem: application to the circuit/hypergraph partitioning (0)
Scenario-Based Risk Management and Simulation Optimization (0)
Heuristic Search for Rank Aggregation with Application to Label Ranking (0)
Chapter 19 ADAPTIVE MEMORY PROJECTION METHODS FOR INTEGER PROGRAMMING (0)
An Interactive Clustering Methodology for High Dimensional Data Mining (0)
GRASP with exterior path-relinking for the multidimensional two-way number partitioning problem (0)
Chapter 1 METAHEURISTIC AGENT PROCESSES ( MAPS ) (0)

This paper list is powered by the following services:

Other Resources About Fred W. Glover

en.wikipedia.org

What Schools Are Affiliated With Fred W. Glover?

Fred W. Glover is affiliated with the following schools:

Fred W. Glover's AcademicInfluence.com Rankings

Computer Science