Fred W. Glover
According to our database^{1},
Fred W. Glover
authored at least 265 papers
between 1967 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis OtherLinks
Homepages:

at zbmath.org

at orcid.org

at id.loc.gov

at dnb.info
On csauthors.net:
Bibliography
2020
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking.
INFORMS J. Comput., 2020
A study of two evolutionary/tabu search approaches for the generalized maxmean dispersion problem.
Expert Syst. Appl., 2020
A SelfOrganizing ExtremePoint TabuSearch Algorithm for Fixed Charge Network Problems with Extensions.
CoRR, 2020
CoRR, 2020
A learningbased memetic algorithm for the multiple vehicle pickup and delivery problem with LIFO loading.
Comput. Ind. Eng., 2020
2019
IEEE Trans. Cybern., 2019
Intensificationdriven tabu search for the minimum differential dispersion problem.
Knowl. Based Syst., 2019
Clusteringdriven evolutionary algorithms: an application of path relinking to the quadratic unconstrained binary optimization problem.
J. Heuristics, 2019
J. Heuristics, 2019
J. Heuristics, 2019
J. Heuristics, 2019
Eur. J. Oper. Res., 2019
CoRR, 2019
4OR, 2019
A TwoIndividual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem.
Proceedings of the ThirtyThird AAAI Conference on Artificial Intelligence, 2019
An Overview of MetaAnalytics: The Promise of Unifying Metaheuristics and Analytics.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019
Proceedings of the Business and Consumer Analytics: New Ideas, 2019
2018
Proceedings of the Handbook of Heuristics., 2018
Networks, 2018
A Novel Mixed Integer Linear Programming Model for Clustering Relational Networks.
J. Optim. Theory Appl., 2018
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci., 2018
Inf. Sci., 2018
A twophase tabuevolutionary algorithm for the 01 multidimensional knapsack problem.
Inf. Sci., 2018
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems.
Eur. J. Oper. Res., 2018
CoRR, 2018
A Tabu search based clustering algorithm and its parallel implementation on Spark.
Appl. Soft Comput., 2018
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Soft Comput., 2017
Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis.
Networks, 2017
New relationships for multineighborhood search for the minimum linear arrangement problem.
J. Discrete Algorithms, 2017
Effective metaheuristic algorithms for the minimum differential dispersion problem.
Eur. J. Oper. Res., 2017
CoRR, 2017
A Tabu Search based clustering algorithm and its parallel implementation on Spark.
CoRR, 2017
Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems.
CoRR, 2017
CoRR, 2017
GRASP with exterior pathrelinking and restricted local search for the multidimensional twoway number partitioning problem.
Comput. Oper. Res., 2017
Appl. Intell., 2017
2016
Doublyrooted stemandcycle ejection chain algorithm for the asymmetric traveling salesman problem.
Networks, 2016
Preface to the 2<sup>nd</sup> Special Issue on metaheuristics in network optimization.
Networks, 2016
Networks, 2016
An evolutionary path relinking approach for the quadratic multiple knapsack problem.
Knowl. Based Syst., 2016
Solving the maximum vertex weight clique problem via binary quadratic programming.
J. Comb. Optim., 2016
J. Heuristics, 2016
Strategic oscillation for the capacitated hub location problem with modular links.
J. Heuristics, 2016
Eur. J. Oper. Res., 2016
Eng. Appl. Artif. Intell., 2016
Ann. Oper. Res., 2016
Proceedings of the Winter Simulation Conference, WSC 2016, 2016
2015
Scholarpedia, 2015
Exact solutions to generalized vertex covering problems: a comparison of two models.
Optim. Lett., 2015
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015
J. Heuristics, 2015
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.
Eur. J. Oper. Res., 2015
Eng. Appl. Artif. Intell., 2015
CoRR, 2015
2014
J. Comb. Optim., 2014
Int. J. of Applied Metaheuristic Computing, 2014
Eng. Appl. Artif. Intell., 2014
CoRR, 2014
Comput. Optim. Appl., 2014
2013
Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013
J. Heuristics, 2013
J. Heuristics, 2013
J. Heuristics, 2013
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems.
Eur. J. Oper. Res., 2013
CoRR, 2013
Comput. Oper. Res., 2013
2012
Eur. J. Oper. Res., 2012
A computational study on the quadratic knapsack problem with multiple constraints.
Comput. Oper. Res., 2012
Comparisons of Commercial MIP Solvers and an Adaptive Memory (Tabu Search) Procedure for a Class of 01 Integer Programming Problems.
Algorithmic Oper. Res., 2012
Ann. Oper. Res., 2012
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012
2011
EM323: a line search based algorithm for solving highdimensional continuous nonlinear optimization problems.
Soft Comput., 2011
IJSIR, 2011
IJSIR, 2011
Int. J. Metaheuristics, 2011
Int. J. Metaheuristics, 2011
Int. J. of Applied Metaheuristic Computing, 2011
J. Heuristics, 2011
Traveling salesman problem heuristics: Leading methods, implementations and latest advances.
Eur. J. Oper. Res., 2011
Algorithmic Oper. Res., 2011
Ann. Oper. Res., 2011
Ann. Oper. Res., 2011
Ann. Oper. Res., 2011
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection.
Ann. Oper. Res., 2011
Ann. Oper. Res., 2011
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
2010
Networks, 2010
Fast twoflip move evaluations for binary unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
Efficient evaluations for solving large 01 unconstrained quadratic optimisation problems.
Int. J. Metaheuristics, 2010
A Study of Tabu Search for Coloring Random 3Colorable Graphs Around the Phase Transition.
Int. J. of Applied Metaheuristic Computing, 2010
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization  Part II: Exploiting Reaction and Resistance.
Int. J. of Applied Metaheuristic Computing, 2010
Metaheuristic Search with Inequalities and Target Objectives for Mixed Binary Optimization Part I: Exploiting Proximity.
Int. J. of Applied Metaheuristic Computing, 2010
J. Heuristics, 2010
Cyber Swarm Algorithms  Improving particle swarm optimization using adaptive memory strategies.
Eur. J. Oper. Res., 2010
Eur. J. Oper. Res., 2010
New concepts, methodologies and algorithms for business education and research in the 21st century.
Decis. Support Syst., 2010
Decis. Support Syst., 2010
Comput. Oper. Res., 2010
Ann. Oper. Res., 2010
Ann. Oper. Res., 2010
4OR, 2010
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010
2009
Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem.
IEEE Trans. Syst. Man Cybern. Part A, 2009
A cooperative parallel tabu search algorithm for the quadratic assignment problem.
Eur. J. Oper. Res., 2009
Eur. J. Oper. Res., 2009
Contributions of Professor William W. Cooper in Operations Research and Management Science.
Eur. J. Oper. Res., 2009
Proceedings of the 2009 Winter Simulation Conference, 2009
Unidimensional Search for Solving Continuous HighDimensional Optimization Problems.
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009
2008
Math. Program., 2008
J. Math. Model. Algorithms, 2008
Int. J. Inf. Technol. Decis. Mak., 2008
Higherorder cover cuts from zeroone knapsack constraints augmented by twosided bounding inequalities.
Discret. Optim., 2008
Inequalities and Target Objectives for Metaheuristic Search  Part I: Mixed Binary Optimization.
Proceedings of the Advances in Metaheuristics for Hard Optimization, 2008
2007
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
An effective modeling and solution approach for the generalized independent set problem.
Optim. Lett., 2007
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.
INFORMS J. Comput., 2007
A class of multilevel balanced FoundationPenalty cuts for mixedinteger programs.
Int. J. Comput. Sci. Eng., 2007
Advances in analytics: Integrating dynamic data mining with simulation optimization.
IBM J. Res. Dev., 2007
Infeasible/feasible search trajectories and directional rounding in integer programming.
J. Heuristics, 2007
Eur. J. Oper. Res., 2007
Solving the maximum edge weight clique problem via unconstrained quadratic programming.
Eur. J. Oper. Res., 2007
Ann. Oper. Res., 2007
A Path Relinking Approach for the MultiResource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Proceedings of the IEEE Congress on Evolutionary Computation, 2007
2006
Int. J. Inf. Technol. Decis. Mak., 2006
A path relinking approach with ejection chains for the generalized assignment problem.
Eur. J. Oper. Res., 2006
Eur. J. Oper. Res., 2006
Comput. Oper. Res., 2006
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem.
Comput. Oper. Res., 2006
Comput. Biol. Chem., 2006
Proceedings of the Winter Simulation Conference WSC 2006, 2006
2005
Math. Program., 2005
J. Comb. Optim., 2005
Adv. Decis. Sci., 2005
J. Heuristics, 2005
Parametric Ghost Image Processes for FixedCharge Problems: A Study of Transportation Networks.
J. Heuristics, 2005
Data structures and ejection chains for solving largescale traveling salesman problems.
Eur. J. Oper. Res., 2005
Discret. Optim., 2005
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
Ann. Oper. Res., 2005
Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic FixedCharge Problems under Nested Constraints.
Ann. Oper. Res., 2005
Ann. Oper. Res., 2005
Proceedings of the 37th Winter Simulation Conference, Orlando, FL, USA, December 47, 2005, 2005
2004
A unified modeling and solution framework for combinatorial optimization problems.
OR Spectr., 2004
INFORMS J. Comput., 2004
INFORMS J. Comput., 2004
J. Heuristics, 2004
A very largescale neighborhood search algorithm for the multiresource generalized assignment problem.
Discret. Optim., 2004
Comparisons and enhancement strategies for linearizing mixed 01 quadratic programs.
Discret. Optim., 2004
Discret. Appl. Math., 2004
Multiobjective process design in multipurpose batch plants using a Tabu Search optimization algorithm.
Comput. Chem. Eng., 2004
Proceedings of the 36th conference on Winter simulation, 2004
Proceedings of the Pacific Asia Conference on Information Systems, 2004
Proceedings of the Principles and Practice of Constraint Programming, 2004
2003
Oper. Res. Lett., 2003
J. Heuristics, 2003
Inteligencia Artif., 2003
Proceedings of the 35th Winter Simulation Conference: Driving Innovation, 2003
Risk analysis software tutorial II: OptFolio  a simulation optimization system for project portfolio planning.
Proceedings of the 35th Winter Simulation Conference: Driving Innovation, 2003
Exploiting Surrogate Constraint Analysis for Fixing Variables in both bounds for Multidimensional Knapsack Problems.
Proceedings of the 4th Mexican International Conference on Computer Science (ENC 2003), 2003
Proceedings of the Handbook of Metaheuristics, 2003
2002
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2002
J. Comb. Optim., 2002
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints.
Int. J. Inf. Technol. Decis. Mak., 2002
Eur. J. Oper. Res., 2002
Discret. Appl. Math., 2002
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions.
Ann. Oper. Res., 2002
OptQuest software tutorial: portfolio optimization for capital investment projects.
Proceedings of the 34th Winter Simulation Conference: Exploring New Frontiers, 2002
2001
J. Glob. Optim., 2001
Eur. J. Oper. Res., 2001
Eur. J. Oper. Res., 2001
Proceedings of the 33nd conference on Winter simulation, 2001
Optimization and system selection: simulation/optimization using "realworld" applications.
Proceedings of the 33nd conference on Winter simulation, 2001
2000
The deterministic multiitem dynamic lot size problem with joint business volume discount.
Ann. Oper. Res., 2000
Proceedings of the 32nd conference on Winter simulation, WSC 2000, 2000
Multilevel cooperative search: application to the circuit/hypergraph partitioning problem.
Proceedings of the 2000 International Symposium on Physical Design, 2000
1999
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory.
INFORMS J. Comput., 1999
Proceedings of the 31st conference on Winter simulation: Simulation, 1999
Proceedings of the Algorithm Engineering, 1999
Multilevel Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning.
Proceedings of the EuroPar '99 Parallel Processing, 5th International EuroPar Conference, Toulouse, France, August 31, 1999
1998
Eur. J. Oper. Res., 1998
Eur. J. Oper. Res., 1998
1997
Telecommun. Syst., 1997
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination.
INFORMS J. Comput., 1997
J. Heuristics, 1997
J. Heuristics, 1997
Discret. Appl. Math., 1997
Generating Cuts from Surrogate Constraint Analysis for ZeroOne and Multiple Choice Programming.
Comput. Optim. Appl., 1997
Proceedings of the Artificial Evolution, Third European Conference, 1997
Kluwer, ISBN: 9781461560890, 1997
1996
Using tabu search to solve the Steiner treestar problem in telecommunications network design.
Telecommun. Syst., 1996
Finding a best traveling salesman 4opt move in the same time as a best 2opt move.
J. Heuristics, 1996
Ejection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.
Discret. Appl. Math., 1996
Ann. Oper. Res., 1996
Proceedings of the 28th conference on Winter simulation, 1996
Proceedings of 1996 IEEE International Conference on Evolutionary Computation, 1996
Surrogate constraint analysisnew heuristics and learning schemes for satisfiability problems.
Proceedings of the Satisfiability Problem: Theory and Applications, 1996
1995
INFORMS J. Comput., 1995
J. Heuristics, 1995
Comput. Oper. Res., 1995
Ann. Oper. Res., 1995
1994
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms).
Discret. Appl. Math., 1994
Comput. Oper. Res., 1994
Applying tabu search with influential diversification to multiprocessor scheduling.
Comput. Oper. Res., 1994
Comput. Oper. Res., 1994
1993
Strong formulations and cutting planes for designing digital data service networks.
Telecommun. Syst., 1993
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequencedependent setup costs and times.
Appl. Intell., 1993
Ann. Oper. Res., 1993
Proceedings of the Cliques, 1993
1992
Network models in optimization and their applications in practice.
Wiley, ISBN: 9780471571384, 1992
1991
J. Intell. Manuf., 1991
Leastcost network topology design for a new service  An application of tabu search.
Ann. Oper. Res., 1991
1990
INFORMS J. Comput., 1990
1989
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures.
Oper. Res., 1989
INFORMS J. Comput., 1989
1988
Layering strategies for creating exploitable structure in linear and integer programs.
Math. Program., 1988
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs.
Math. Program., 1988
1986
Math. Program., 1986
Discret. Appl. Math., 1986
Comput. Oper. Res., 1986
Comput. Oper. Res., 1986
1985
Oper. Res., 1985
1984
Networks, 1984
Discret. Appl. Math., 1984
1981
Oper. Res., 1981
1980
Technical Note  Equivalence of the 01 Integer Programming Problem to Discrete Generalized and Pure Networks.
Oper. Res., 1980
An extended abstract of an indepth algorithmic and computational study for maximum flow problems.
Discret. Appl. Math., 1980
1979
A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees.
Networks, 1979
Math. Program., 1979
Math. Oper. Res., 1979
1978
Oper. Res., 1978
1977
Math. Program., 1977
Math. Program., 1977
The NETFORM concept: A more effective model form and solution procedure for large scale nonlinear problems.
Proceedings of the 1977 annual conference, 1977
1976
A practitioner's guide to the state of large scale network and networkrelated problems.
Proceedings of the American Federation of Information Processing Societies: 1976 National Computer Conference, 1976
1975
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently.
ACM Trans. Math. Softw., 1975
Math. Program., 1975
Math. Program., 1975
Oper. Res., 1975
Past, present and future of large scale transshipment computer codes and applications.
Comput. Oper. Res., 1975
1974
Implementation and computational comparisons of primal, dual and primaldual computer codes for minimum cost network flow problems.
Networks, 1974
An improved version of the outofkilter method and a comparative study of computer codes.
Math. Program., 1974
Z. Oper. Research, 1974
Technical Note  Converting the 01 Polynomial Programming Problem to a 01 Linear Program.
Oper. Res., 1974
Oper. Res., 1974
Discret. Math., 1974
1973
Math. Program., 1973
Further Reduction of ZeroOne Polynomial Programming Problems to ZeroOne linear Programming Problems.
Oper. Res., 1973
Oper. Res., 1973
Oper. Res., 1973
Oper. Res., 1973
Discret. Math., 1973
Proceedings of the ACM annual conference, Atlanta, Georgia, USA, August 2729, 1973, 1973
1972
Math. Program., 1972
Z. Oper. Research, 1972
Oper. Res., 1972
Oper. Res., 1972
1971
Oper. Res., 1971
Oper. Res., 1971
1970
Oper. Res., 1970
1968
Oper. Res., 1968
Oper. Res., 1968
Oper. Res., 1968
1967
Oper. Res., 1967