Person:168083

Available identifiers

zbMath Open glover.fred-wDBLP46/1455WikidataQ5496470 ScholiaQ5496470MaRDI QIDQ168083

List of research outcomes

Publication	Date of Publication	Type
Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis	2024-05-03	Paper
Detecting Critical Nodes in Sparse Graphs via “Reduce-Solve-Combine” Memetic Search	2024-03-26	Paper
Perturbation-Based Thresholding Search for Packing Equal Circles and Spheres	2024-03-22	Paper
An extreme‐point tabu‐search algorithm for fixed‐charge network problems	2023-12-11	Paper
Dual-neighborhood iterated local search for routing and wavelength assignment	2023-11-13	Paper
Responsive strategic oscillation for solving the disjunctively constrained knapsack problem	2023-07-10	Paper
Tabu search exploiting local optimality in binary optimization	2023-07-10	Paper
Iterated dynamic neighborhood search for packing equal circles on a sphere	2023-07-04	Paper
Applications and Computational Advances for Solving the QUBO Model	2022-11-15	Paper
Quantum bridge analytics. I: A tutorial on formulating and using QUBO models	2022-08-01	Paper
Quantum bridge analytics. II: QUBO-plus, network optimization and combinatorial chaining for asset exchange	2022-08-01	Paper
Unforeseen Consequences of “Tabu” Choices—A Retrospective	2022-07-01	Paper
A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets	2022-06-30	Paper
On convergence of scatter search and star paths with directional rounding for 0--1 mixed integer programs	2022-01-05	Paper
Bi-objective optimization of biclustering with binary data	2021-11-23	Paper
Tabu search tutorial. A graph drawing application	2021-09-02	Paper
Rejoinder on: ``Tabu search tutorial. A graph drawing application	2021-09-02	Paper
Quantum bridge analytics II: QUBO-plus, network optimization and combinatorial chaining for asset exchange	2021-05-20	Paper
A new approach to generate pattern-efficient sets of non-dominated vectors for multi-objective optimization	2021-05-03	Paper
Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking	2020-12-11	Paper
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem	2020-09-08	Paper
Quantum bridge analytics. I: A tutorial on formulating and using QUBO models	2020-01-13	Paper
Probabilistic tabu search for the cross-docking assignment problem	2019-04-30	Paper
GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem	2018-07-11	Paper
Effective metaheuristic algorithms for the minimum differential dispersion problem	2018-05-25	Paper
A novel mixed integer linear programming model for clustering relational networks	2018-04-13	Paper
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems	2017-11-23	Paper
New relationships for multi-neighborhood search for the minimum linear arrangement problem	2017-11-09	Paper
Probabilistic GRASP-tabu search algorithms for the UBQP problem	2016-11-10	Paper
A hybrid metaheuristic approach for the capacitated arc routing problem	2016-10-07	Paper
Solving the maximum vertex weight clique problem via binary quadratic programming	2016-08-31	Paper
Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs	2016-07-06	Paper
\(f\)-flip strategies for unconstrained binary quadratic programming	2016-04-20	Paper
Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel	2015-11-26	Paper
Exact solutions to generalized vertex covering problems: a comparison of two models	2015-10-06	Paper
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems	2015-07-28	Paper
Polynomial unconstrained binary optimisation -- part 1	2015-02-23	Paper
Polynomial unconstrained binary optimisation -- part 2	2015-02-23	Paper
The unconstrained binary quadratic programming problem: a survey	2014-09-05	Paper
Path relinking for unconstrained binary quadratic programming	2014-07-27	Paper
Strategic oscillation for the quadratic multiple knapsack problem	2014-05-23	Paper
https://portal.mardi4nfdi.de/entity/Q2865864	2013-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q2865877	2013-12-11	Paper
Multi-neighborhood tabu search for the maximum weight clique problem	2012-11-15	Paper
A computational study on the quadratic knapsack problem with multiple constraints	2012-11-15	Paper
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization	2012-06-18	Paper
An Ejection Chain Approach for the Generalized Assignment Problem	2012-06-08	Paper
DNA Sequencing—Tabu and Scatter Search Combined	2012-06-08	Paper
Traveling salesman problem heuristics: leading methods, implementations and latest advances	2012-05-14	Paper
Optimizing a Ring-Based Private Line Telecommunication Network Using Tabu Search	2012-02-12	Paper
https://portal.mardi4nfdi.de/entity/Q3109948	2012-01-26	Paper
A simple and effective algorithm for the MaxMin diversity problem	2011-11-17	Paper
A filter-and-fan approach to the 2D HP model of the protein folding problem	2011-11-17	Paper
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection	2011-06-08	Paper
Hybrid scatter tabu search for unconstrained global optimization	2011-06-08	Paper
The case for strategic oscillation	2011-06-08	Paper
Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems	2011-05-23	Paper
Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems	2011-05-23	Paper
Tabu search -- uncharted domains	2011-05-20	Paper
RAMP for the capacitated minimum spanning tree problem	2011-04-08	Paper
A hybrid metaheuristic approach to solving the UBQP problem	2010-12-20	Paper
Diversification-driven tabu search for unconstrained binary quadratic problems	2010-12-06	Paper
An ejection chain algorithm for the quadratic assignment problem	2010-11-24	Paper
Alternating control tree search for knapsack/covering problems	2010-05-21	Paper
Ejection chain and filter-and-fan methods in combinatorial optimization	2010-05-10	Paper
Adaptive memory programming for constrained global optimization	2010-03-19	Paper
Cyber swarm algorithms - improving particle swarm optimization using adaptive memory strategies	2009-11-16	Paper
A note on xQx as a modelling and solution framework for the linear ordering problem	2009-09-13	Paper
Contributions of Professor William W. Cooper in operations research and management science	2009-04-08	Paper
SIMULATION OPTIMIZATION: APPLICATIONS IN RISK MANAGEMENT	2009-02-10	Paper
Finding local optima of high-dimensional functions using direct search methods	2009-01-08	Paper
A cooperative parallel tabu search algorithm for the quadratic assignment problem	2009-01-08	Paper
Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities	2008-10-29	Paper
Principles and Practice of Constraint Programming – CP 2004	2008-09-09	Paper
Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization	2008-07-01	Paper
A new modeling and solution approach for the number partitioning problem	2008-07-01	Paper
Infeasible/feasible search trajectories and directional rounding in integer programming	2008-06-23	Paper
Multi-objective meta-heuristics for the traveling salesman problem with profits	2008-06-11	Paper
Second-order cover inequalities	2008-06-04	Paper
https://portal.mardi4nfdi.de/entity/Q5431856	2008-01-02	Paper
A Path Relinking Approach for the Multi-Resource Generalized Quadratic Assignment Problem	2007-11-29	Paper
An effective modeling and solution approach for the generalized independent set problem	2007-11-05	Paper
Dealing with repetitions in sequencing by hybridization	2007-06-12	Paper
Ejection chain and filter-and-fan methods in combinatorial optimization	2007-05-24	Paper
Solving the maximum edge weight clique problem via unconstrained quadratic programming	2007-04-19	Paper
Solving group technology problems via clique partitioning	2007-04-19	Paper
Exploiting nested inequalities and surrogate constraints	2007-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q5393829	2006-10-24	Paper
Using the unconstrained quadratic program to model and solve Max 2-SAT problems	2006-10-04	Paper
Further extension of the TSP assign neighborhood	2006-05-29	Paper
Parametric tabu-search for mixed integer programs	2006-05-16	Paper
Evolutionary approaches to DNA sequencing with errors	2006-03-07	Paper
An unconstrained quadratic binary programming approach to the vertex coloring problem	2006-03-07	Paper
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints	2006-03-07	Paper
https://portal.mardi4nfdi.de/entity/Q3372329	2006-02-20	Paper
Clustering of microarray data via clique partitioning	2005-12-13	Paper
COLE: a new heuristic approach for fixed charge problem computational results	2005-11-07	Paper
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem	2005-11-01	Paper
The feasibility pump	2005-10-31	Paper
Principles of scatter search	2005-10-26	Paper
A path relinking approach with ejection chains for the generalized assignment problem	2005-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q5692623	2005-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5692631	2005-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q5692642	2005-09-28	Paper
Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs	2005-08-22	Paper
A very large-scale neighborhood search algorithm for the multi-resource generalized assignment problem	2005-08-22	Paper
Chvatal--Gomory--tier cuts for general integer programs	2005-06-01	Paper
https://portal.mardi4nfdi.de/entity/Q4667330	2005-04-19	Paper
https://portal.mardi4nfdi.de/entity/Q4667339	2005-04-19	Paper
Data structures and ejection chains for solving large-scale traveling salesman problems	2004-11-22	Paper
A unified modeling and solution framework for combinatorial optimization problems	2004-09-22	Paper
Adaptive memory search for Boolean optimization problems	2004-08-19	Paper
https://portal.mardi4nfdi.de/entity/Q4461910	2004-05-18	Paper
Scatter Search and Path Relinking: Advances and Applications	2004-03-07	Paper
Foundation-penalty cuts for mixed-integer programs.	2003-11-17	Paper
Tutorial on surrogate constraint approaches for optimization in graphs	2003-08-28	Paper
Resolution search and dynamic branch-and-bound	2003-06-09	Paper
Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions	2003-03-10	Paper
An experimental evaluation of a scatter search for the linear ordering problem	2002-12-15	Paper
Tabu search - wellsprings and challenges	2002-08-18	Paper
Solving zero-one mixed integer programming problems using tabu search	2002-08-18	Paper
Tabu search and finite convergence	2002-06-24	Paper
One-pass heuristics for large-scale unconstrained binary quadratic problems	2002-06-16	Paper
Adaptive Memory Tabu Search for Binary Quadratic Programs	2002-04-17	Paper
https://portal.mardi4nfdi.de/entity/Q4550768	2002-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q2731676	2001-07-29	Paper
Construction heuristics for the asymmetric TSP.	2001-03-28	Paper
The deterministic multi-item dynamic lot size problem with joint business volume discount	2001-01-17	Paper
Reducing the bandwidth of a sparse matrix with tabu search.	2001-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4495174	2000-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4495177	2000-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q4231138	2000-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q4247068	1999-10-05	Paper
https://portal.mardi4nfdi.de/entity/Q4247468	1999-09-23	Paper
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory	1999-01-01	Paper
General purpose heuristics for integer programming. II	1998-11-08	Paper
Heuristic algorithms for the maximum diversity problem	1998-07-20	Paper
Tabu Search and Ejection Chains—Application to a Node Weighted Version of the Cardinality-Constrained TSP	1998-06-22	Paper
Tabu search for the multilevel generalized assignment problem	1998-06-11	Paper
https://portal.mardi4nfdi.de/entity/Q4352217	1998-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q4375771	1998-03-02	Paper
https://portal.mardi4nfdi.de/entity/Q4377046	1998-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4350063	1997-12-11	Paper
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination	1997-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4350064	1997-10-27	Paper
Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming	1997-10-23	Paper
https://portal.mardi4nfdi.de/entity/Q4354785	1997-09-17	Paper
Finding a best traveling salesman 4-opt move in the same time as a best 2-opt move	1997-09-02	Paper
https://portal.mardi4nfdi.de/entity/Q4350067	1997-08-28	Paper
General purpose heuristics for integer programming. I	1997-08-28	Paper
TSP ejection chains	1997-08-11	Paper
The travelling salesman problem: new solvable cases and linkages with the development of approximation algorithms	1997-08-07	Paper
https://portal.mardi4nfdi.de/entity/Q5687259	1997-06-22	Paper
Tabu search for graph partitioning	1996-11-25	Paper
Ejection chains, reference structures and alternating path methods for traveling salesman problems	1996-10-03	Paper
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories	1996-03-12	Paper
A discrete optimization model for preserving biological diversity	1996-03-12	Paper
New results for aggregating integer-valued equations	1996-02-11	Paper
Applying tabu search with influential diversification to multiprocessor scheduling	1995-06-12	Paper
Genetic algorithms and tabu search: Hybrids for optimization	1995-02-13	Paper
Optimization by ghost image processes in neural networks	1995-01-11	Paper
A study of diversification strategies for the quadratic assignment problem	1995-01-11	Paper
Scatter search and star-paths: Beyond the genetic metaphor	1995-01-01	Paper
Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)	1994-11-27	Paper
Bandwidth Packing: A Tabu Search Approach	1993-08-31	Paper
Extensions of the Petal Method for Vehicle Routeing	1993-08-16	Paper
A user's guide to tabu search	1993-08-16	Paper
Tabu Search—Part I	1993-01-16	Paper
Tabu Search—Part II	1993-01-16	Paper
https://portal.mardi4nfdi.de/entity/Q3987193	1992-06-28	Paper
Surrogate Constraints in Integer Programming	1992-06-25	Paper
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures	1989-01-01	Paper
A network-related nuclear power plant model with an intelligent branch- and-bound solution approach	1989-01-01	Paper
A modeling/solution approach for optimal deployment of a weapons arsenal	1989-01-01	Paper
New approaches for heuristic search: A bilateral linkage with artificial intelligence	1989-01-01	Paper
A Stochastic Generalized Network Model and Large-Scale Mean-Variance Algorithm for Portfolio Selection	1988-01-01	Paper
A matroid algorithm and its application to the efficient solution of two optimization problems on graphs	1988-01-01	Paper
Layering strategies for creating exploitable structure in linear and integer programs	1988-01-01	Paper
A Simple Criterion for a Graph to have a Perfect Matching	1987-01-01	Paper
Threshold assignment algorithm	1986-01-01	Paper
Two algorithms for weighted matroid intersection	1986-01-01	Paper
The 2-quasi-greedy algorithm for cardinality constrained matroid bases	1986-01-01	Paper
Future paths for integer programming and links to artificial intelligence	1986-01-01	Paper
A New Polynomially Bounded Shortest Path Algorithm	1985-01-01	Paper
Basis exchange characterizations for the simplex son algorithm for LP/embedded networks	1985-01-01	Paper
New Polynomial Shortest Path Algorithms and Their Computational Attributes	1985-01-01	Paper
A primal simplex variant for the maximum-flow problem	1984-01-01	Paper
A note on specialized versus unspecialized methods for maximum-flow problems	1984-01-01	Paper
An Improved MIP Formulation for Products of Discrete and Continuous Variables	1984-01-01	Paper
An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems	1984-01-01	Paper
Aggregation of nonnegative integer-valued equations	1984-01-01	Paper
A mixed-integer programming approach to the clustering problem	1983-01-01	Paper
A comparison of pivot selection rules for primal simplex based network codes	1983-01-01	Paper
Transformations Enlarging the Network Portion of a Class or LP/Embedded Generalized Networks	1982-01-01	Paper
Network Relaxations and Lower Bounds for Multiple Choice Problems	1982-01-01	Paper
Recent Developments in Computer Implementation Technology for Network Flow Algorithms	1982-01-01	Paper
A New Optimization Method for Large Scale Fixed Charge Transportation Problems	1981-01-01	Paper
The simplex SON algorithm for LP/embedded network problems	1981-01-01	Paper
Simple but powerful goal programming models for discriminant problems	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3865868	1980-01-01	Paper
Technical Note—Equivalence of the 0-1 Integer Programming Problem to Discrete Generalized and Pure Networks	1980-01-01	Paper
An extended abstract of an indepth algorithmic and computational study for maximum flow problems	1980-01-01	Paper
A o(n logn) algorithm for LP knapsacks with GUB constraints	1979-01-01	Paper
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks	1979-01-01	Paper
Enhancements Of Spanning Tree Labelling Procedures For Network Optimization	1979-01-01	Paper
The generalized alternating path algorithm for transportation problems	1978-01-01	Paper
Linear programming for weighted deviation problems using compact basis techniques	1978-01-01	Paper
Compact LP bases for a class of IP problems	1977-01-01	Paper
The alternating basis algorithm for assignment problems	1977-01-01	Paper
Improved Linear Integer Programming Formulations of Nonlinear Integer Problems	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101626	1976-01-01	Paper
Inequalities for mixed integer programs with structure	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4178800	1976-01-01	Paper
Improved convexity cuts for lattice point problems	1976-01-01	Paper
New results on equivalent integer programming formulations	1975-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4068469	1975-01-01	Paper
Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently	1975-01-01	Paper
Surrogate Constraint Duality in Mathematical Programming	1975-01-01	Paper
Polyhedral annexation in mixed integer and combinatorial programming	1975-01-01	Paper
Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program	1974-01-01	Paper
Optimal Weighted Ancestry Relationships	1974-01-01	Paper
An improved version of the out-of-kilter method and a comparative study of computer codes	1974-01-01	Paper
A generalized recursive algorithm for a class of non‐stationary regeneration (scheduling) problems	1974-01-01	Paper
Polyhedral convexity cuts and negative edge extensions	1974-01-01	Paper
First facets of the octahedron	1974-01-01	Paper
The Generalized Lattice-Point Problem	1973-01-01	Paper
On the equivalence of some generalized network problems to pure network problems	1973-01-01	Paper
Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems	1973-01-01	Paper
Convexity Cuts and Cut Search	1973-01-01	Paper
Concave Programming Applied to a Special Class of 0-1 Integer Programs	1973-01-01	Paper
Convexity cuts for multiple choice problems	1973-01-01	Paper
Technical Note—A Note on Zero-One Integer and Concave Programming	1972-01-01	Paper
Higher Order Tree Dual Approximation Methods for the Distribution Problem	1972-01-01	Paper
Basic Dual Feasible Solutions for a Class of Generalized Networks	1972-01-01	Paper
Aggregating diophantine equations	1972-01-01	Paper
Cut search methods in integer programming	1972-01-01	Paper
An Intersection Cut from the Dual of the Unit Hypercube	1971-01-01	Paper
The lower bounded and partial upper bounded distribution model	1971-01-01	Paper
Flows in Arborescences	1971-01-01	Paper
A Note on Extreme-Point Solutions and A Paper by Lemke, Salkin, and Spielberg	1971-01-01	Paper
Faces of the Gomory polyhedron for cyclic groups	1971-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101617	1970-01-01	Paper
Integer Programming over a Finite Additive Group	1969-01-01	Paper
Surrogate Constraints	1968-01-01	Paper
A New Foundation for a Simplified Primal Integer Programming Algorithm	1968-01-01	Paper
A Note on Linear Programming and Integer Feasibility	1968-01-01	Paper
A pseudo primal-dual integer programming algorithm	1967-01-01	Paper
Maximum matching in a convex bipartite graph	1967-01-01	Paper
Generalized Cuts in Diophantine Programming	1966-01-01	Paper
A Note on the Additive Algorithm of Balas	1965-01-01	Paper
A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem	1965-01-01	Paper
A Note on the Additive Algorithm of Balas	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5609863	1965-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5608582	1964-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Fred Glover