Fred W. Glover
According to our database^{1},
Fred W. Glover
authored at least 262 papers
between 1967 and 2020.
Collaborative distances:
Collaborative distances:
Awards
IEEE Fellow
IEEE Fellow 2013, "For contributions to computer based optimization".
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
A study of two evolutionary/tabu search approaches for the generalized maxmean dispersion problem.
Expert Syst. Appl., 2020
Biobjective Optimization of Biclustering with Binary Data.
CoRR, 2020
2019
Memetic Search for Identifying Critical Nodes in Sparse Graphs.
IEEE Trans. Cybernetics, 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
Intensification, Diversification and Learning in metaheuristic optimization.
J. Heuristics, 2019
Diversification methods for zeroone optimization.
J. Heuristics, 2019
Diversificationbased learning in computing and optimization.
J. Heuristics, 2019
Probabilistic Tabu Search for the CrossDocking Assignment Problem.
Eur. J. Oper. Res., 2019
Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange.
CoRR, 2019
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models.
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
Hotel Classification Using MetaAnalytics: A Case Study with Cohesive Clustering.
Proceedings of the Business and Consumer Analytics: New Ideas, 2019
2018
A History of Metaheuristics.
Proceedings of the Handbook of Heuristics., 2018
New assignmentbased neighborhoods for traveling salesman and routing problems.
Networks, 2018
A Novel Mixed Integer Linear Programming Model for Clustering Relational Networks.
J. Optimization Theory and Applications, 2018
Adaptive tabu search with strategic oscillation for the bipartite boolean quadratic programming problem with partitioned variables.
Inf. Sci., 2018
Solutionbased tabu search for the maximum minsum dispersion problem.
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
A Tutorial on Formulating QUBO Models.
CoRR, 2018
A Tabu search based clustering algorithm and its parallel implementation on Spark.
Appl. Soft Comput., 2018
Principles and Strategies of Tabu Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics, 2018
2017
Pseudocentroid clustering.
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
A History of Metaheuristics.
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
Diversification Methods for ZeroOne Optimization.
CoRR, 2017
GRASP with exterior pathrelinking and restricted local search for the multidimensional twoway number partitioning problem.
Comput. Oper. Res., 2017
Adaptive pattern search for largescale optimization.
Appl. Intell., 2017
2016
Doublyrooted stemandcycle ejection chain algorithm for the asymmetric traveling salesman problem.
Networks, 2016
Preface to the 2^{nd} Special Issue on metaheuristics in network optimization.
Networks, 2016
Preface.
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
Multiwave algorithms for metaheuristic optimization.
J. Heuristics, 2016
Strategic oscillation for the capacitated hub location problem with modular links.
J. Heuristics, 2016
A hybrid metaheuristic approach for the capacitated arc routing problem.
Eur. J. Oper. Res., 2016
A learningbased path relinking algorithm for the bandwidth coloring problem.
Eng. Appl. Artif. Intell., 2016
fFlip strategies for unconstrained binary quadratic programming.
Annals OR, 2016
Coupling optimization and statistical analysis with simulation models.
Proceedings of the Winter Simulation Conference, WSC 2016, 2016
2015
Metaheuristics.
Scholarpedia, 2015
Exact solutions to generalized vertex covering problems: a comparison of two models.
Optimization Letters, 2015
Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization.
Inf. Sci., 2015
A tabu search algorithm for cohesive clustering problems.
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
Backtracking based iterated tabu search for equitable coloring.
Eng. Appl. Artif. Intell., 2015
Narrow Gauge and Analytical Branching Strategies for Mixed Integer Programming.
CoRR, 2015
2014
The unconstrained binary quadratic programming problem: a survey.
J. Comb. Optim., 2014
Exterior Path Relinking for ZeroOne Optimization.
Int. J. of Applied Metaheuristic Computing, 2014
A tabu search based memetic algorithm for the maximum diversity problem.
Eng. Appl. Artif. Intell., 2014
Path Relinking for Bandwidth Coloring Problem.
CoRR, 2014
Strategic oscillation for the quadratic multiple knapsack problem.
Comp. Opt. and Appl., 2014
2013
Designing effective improvement methods for scatter search: an experimental study on global optimization.
Soft Comput., 2013
Backbone guided tabu search for solving the UBQP problem.
J. Heuristics, 2013
Solving large scale Max Cut problems via tabu search.
J. Heuristics, 2013
Introduction to special xQx issue.
J. Heuristics, 2013
Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems.
Eur. J. Oper. Res., 2013
Solving the minimum sum coloring problem via binary quadratic programming
CoRR, 2013
Probabilistic GRASPTabu Search algorithms for the UBQP problem.
Comput. Oper. Res., 2013
2012
Path relinking for unconstrained binary quadratic programming.
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 Operations Research, 2012
Multineighborhood tabu search for the maximum weight clique problem.
Annals OR, 2012
A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization.
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
A Complementary Cyber Swarm Algorithm.
IJSIR, 2011
Scatter Search and Path Relinking : A Tutorial on the Linear Arrangement Problem.
IJSIR, 2011
Polynomial unconstrained binary optimisation  Part 2.
IJMHeur, 2011
Polynomial unconstrained binary optimisation  Part 1.
IJMHeur, 2011
PseudoCut Strategies for Global Optimization.
Int. J. of Applied Metaheuristic Computing, 2011
Neighborhood analysis: a case study on curriculumbased course timetabling.
J. Heuristics, 2011
Traveling salesman problem heuristics: Leading methods, implementations and latest advances.
Eur. J. Oper. Res., 2011
The AID Method for Global Optimization.
Algorithmic Operations Research, 2011
A filterandfan approach to the 2D HP model of the protein folding problem.
Annals OR, 2011
A simple and effective algorithm for the MaxMin diversity problem.
Annals OR, 2011
The case for strategic oscillation.
Annals OR, 2011
Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection.
Annals OR, 2011
Hybrid scatter tabu search for unconstrained global optimization.
Annals OR, 2011
Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2011
2010
An ejection chain algorithm for the quadratic assignment problem.
Networks, 2010
Fast twoflip move evaluations for binary unconstrained quadratic optimisation problems.
IJMHeur, 2010
Efficient evaluations for solving large 01 unconstrained quadratic optimisation problems.
IJMHeur, 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
Alternating control tree search for knapsack/covering problems.
J. Heuristics, 2010
Cyber Swarm Algorithms  Improving particle swarm optimization using adaptive memory strategies.
Eur. J. Oper. Res., 2010
A hybrid metaheuristic approach to solving the UBQP problem.
Eur. J. Oper. Res., 2010
New concepts, methodologies and algorithms for business education and research in the 21st century.
Decis. Support Syst., 2010
Classification by vertical and cutting multihyperplane decision tree induction.
Decis. Support Syst., 2010
Adaptive memory programming for constrained global optimization.
Comput. Oper. Res., 2010
RAMP for the capacitated minimum spanning tree problem.
Annals OR, 2010
Ejection chain and filterandfan methods in combinatorial optimization.
Annals OR, 2010
Diversificationdriven tabu search for unconstrained binary quadratic problems.
4OR, 2010
A Study of Memetic Search with Multiparent Combination for UBQP.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010
2009
Multistart Tabu Search and Diversification Strategies for the Quadratic Assignment Problem.
IEEE Trans. Systems, Man, and Cybernetics, Part A, 2009
A cooperative parallel tabu search algorithm for the quadratic assignment problem.
Eur. J. Oper. Res., 2009
Finding local optima of highdimensional functions using direct search methods.
Eur. J. Oper. Res., 2009
Contributions of Professor William W. Cooper in Operations Research and Management Science.
Eur. J. Oper. Res., 2009
A Framework for the Optimization and Analysis of Agentbased Models.
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
An Adaptive Memory Procedure for Continuous Optimization.
Proceedings of the Ninth International Conference on Intelligent Systems Design and Applications, 2009
2008
Secondorder cover inequalities.
Math. Program., 2008
Multiobjective Metaheuristics for the Traveling Salesman Problem with Profits.
J. Math. Model. Algorithms, 2008
Simulation Optimization: Applications in Risk Management.
International Journal of Information Technology and Decision Making, 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
Principles of Tabu Search.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007
An effective modeling and solution approach for the generalized independent set problem.
Optimization Letters, 2007
Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization.
INFORMS Journal on Computing, 2007
A class of multilevel balanced FoundationPenalty cuts for mixedinteger programs.
IJCSE, 2007
Advances in analytics: Integrating dynamic data mining with simulation optimization.
IBM Journal of Research and Development, 2007
Infeasible/feasible search trajectories and directional rounding in integer programming.
J. Heuristics, 2007
Exploiting nested inequalities and surrogate constraints.
Eur. J. Oper. Res., 2007
Solving the maximum edge weight clique problem via unconstrained quadratic programming.
Eur. J. Oper. Res., 2007
Tabu search  Uncharted domains.
Annals OR, 2007
A Path Relinking Approach for the MultiResource Generalized Quadratic Assignment Problem.
Proceedings of the Engineering Stochastic Local Search Algorithms. Designing, 2007
Scatter PSO  A more effective form of Particle Swarm Optimization.
Proceedings of the IEEE Congress on Evolutionary Computation, 2007
2006
New Optimization Models for Data Mining.
International Journal of Information Technology and Decision Making, 2006
A path relinking approach with ejection chains for the generalized assignment problem.
Eur. J. Oper. Res., 2006
Principles of scatter search.
Eur. J. Oper. Res., 2006
Parametric tabusearch for mixed integer programs.
Comput. Oper. Res., 2006
Implementation analysis of efficient heuristic algorithms for the traveling salesman problem.
Comput. Oper. Res., 2006
Dealing with repetitions in sequencing by hybridization.
Comput. Biology Chem., 2006
Enhancing business process management with simulation optimization.
Proceedings of the Winter Simulation Conference WSC 2006, 2006
2005
The feasibility pump.
Math. Program., 2005
Clustering of Microarray data via Clique Partitioning.
J. Comb. Optim., 2005
A new modeling and solution approach for the number partitioning problem.
JAMDS, 2005
Further Extension of the TSP Assign Neighborhood.
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
ChvatalGomorytier cuts for general integer programs.
Discret. Optim., 2005
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
Annals OR, 2005
Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic FixedCharge Problems under Nested Constraints.
Annals OR, 2005
Evolutionary Approaches to DNA Sequencing with Errors.
Annals OR, 2005
Simulation optimization: a review, new developments, and applications.
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 Spectrum, 2004
An Ejection Chain Approach for the Generalized Assignment Problem.
INFORMS Journal on Computing, 2004
DNA Sequencing  Tabu and Scatter Search Combined.
INFORMS Journal on Computing, 2004
A Hybrid Improvement Heuristic for the OneDimensional Bin Packing Problem.
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
Adaptive memory search for Boolean optimization problems.
Discret. Appl. Math., 2004
Multiobjective process design in multipurpose batch plants using a Tabu Search optimization algorithm.
Computers & Chemical Engineering, 2004
New Advances and Applications for Marrying Simulation and Optimization.
Proceedings of the 36th conference on Winter simulation, 2004
An Interactive Clustering Methodology for High Dimensional Data Mining.
Proceedings of the Pacific Asia Conference on Information Systems, 2004
ID Walk: A Candidate List Strategy with a Simple Diversification Device.
Proceedings of the Principles and Practice of Constraint Programming, 2004
2003
Foundationpenalty cuts for mixedinteger programs.
Oper. Res. Lett., 2003
Tutorial on Surrogate Constraint Approaches for Optimization in Graphs.
J. Heuristics, 2003
Búsqueda Tabú.
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial, 2003
Simulationbased optimization: practical introduction to simulation optimization.
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
Scatter Search and Path Relinking: Advances and Applications.
Proceedings of the Handbook of Metaheuristics, 2003
2002
Multilevel cooperative search for the circuit/hypergraphpartitioning problem.
IEEE Trans. on CAD of Integrated Circuits and Systems, 2002
Resolution Search and Dynamic BranchandBound.
J. Comb. Optim., 2002
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints.
International Journal of Information Technology and Decision Making, 2002
Onepass heuristics for largescale unconstrained binary quadratic problems.
Eur. J. Oper. Res., 2002
Tabu search and finite convergence.
Discret. Appl. Math., 2002
Cutting and Surrogate Constraint Analysis for Improved Multidimensional Knapsack Solutions.
Annals OR, 2002
OptQuest software tutorial: portfolio optimization for capital investment projects.
Proceedings of the 34th Winter Simulation Conference: Exploring New Frontiers, 2002
2001
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem.
J. Global Optimization, 2001
Reducing the bandwidth of a sparse matrix with tabu search.
Eur. J. Oper. Res., 2001
Construction heuristics for the asymmetric TSP.
Eur. J. Oper. Res., 2001
Panel: simulation optimization: future of simulation optimization.
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.
Annals OR, 2000
Integrating optimization and simulation: research and practice.
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 Journal on Computing, 1999
New advances for wedding optimization and simulation.
Proceedings of the 31st conference on Winter simulation: Simulation, 1999
Construction Heuristics and Domination Analysis for the Asymmetric TSP.
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
Solving zeroone mixed integer programming problems using tabu search.
Eur. J. Oper. Res., 1998
Tabu search  wellsprings and challenges.
Eur. J. Oper. Res., 1998
1997
Tabu search for dynamic routing communications network design.
Telecommunication Systems, 1997
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination.
INFORMS Journal on Computing, 1997
General purpose heuristics for integer programming  Part I.
J. Heuristics, 1997
General Purpose Heuristics for Integer ProgrammingPart II.
J. Heuristics, 1997
TSP Ejection Chains.
Discret. Appl. Math., 1997
Generating Cuts from Surrogate Constraint Analysis for ZeroOne and Multiple Choice Programming.
Comp. Opt. and Appl., 1997
A Template for Scatter Search and Path Relinking.
Proceedings of the Artificial Evolution, Third European Conference, 1997
Tabu Search.
Kluwer, ISBN: 9781461560890, 1997
1996
Using tabu search to solve the Steiner treestar problem in telecommunications network design.
Telecommunication Systems, 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
Tabu search for graph partitioning.
Annals OR, 1996
New Advances and Applications of Combining Simulation and Optimization.
Proceedings of the 28th conference on Winter simulation, 1996
A Scatter Search Approach for Unconstrained Continuous Optimization.
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
Tabu Thresholding: Improved Search by Nonmonotonic Trajectories.
INFORMS Journal on Computing, 1995
Today's advances and tomorrow's challenges.
J. Heuristics, 1995
Genetic algorithms and tabu search: Hybrids for optimization.
Comput. Oper. Res., 1995
New results for aggregating integervalued equations.
Annals OR, 1995
1994
Tabu Search for Nonlinear and Parametric Optimization (with Links to Genetic Algorithms).
Discret. Appl. Math., 1994
A study of diversification strategies for the quadratic assignment problem.
Comput. Oper. Res., 1994
Applying tabu search with influential diversification to multiprocessor scheduling.
Comput. Oper. Res., 1994
Optimization by ghost image processes in neural networks.
Comput. Oper. Res., 1994
1993
Strong formulations and cutting planes for designing digital data service networks.
Telecommunication Systems, 1993
Intelligent scheduling with tabu search: An application to jobs with linear delay penalties and sequencedependent setup costs and times.
Appl. Intell., 1993
A user's guide to tabu search.
Annals OR, 1993
Coloring by tabu branch and bound.
Proceedings of the Cliques, 1993
1992
Network models in optimization and their applications in practice.
Wiley, ISBN: 9780471571384, 1992
1991
Tabu search methods for a single machine scheduling problem.
J. Intelligent Manufacturing, 1991
Leastcost network topology design for a new service  An application of tabu search.
Annals OR, 1991
1990
Tabu Search  Part II.
INFORMS Journal on Computing, 1990
1989
New Sharpness Properties, Algorithms and Complexity Bounds for Partitioning Shortest Path Procedures.
Operations Research, 1989
Tabu Search  Part I.
INFORMS Journal on Computing, 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
Two algorithms for weighted matroid intersection.
Math. Program., 1986
The 2quasigreedy algorithm for cardinality constrained matroid bases.
Discret. Appl. Math., 1986
The general employee scheduling problem. An integration of MS and AI.
Comput. Oper. Res., 1986
Future paths for integer programming and links to artificial intelligence.
Comput. Oper. Res., 1986
1985
A New Polynomially Bounded Shortest Path Algorithm.
Operations Research, 1985
1984
Computational study of an improved shortest path algorithm.
Networks, 1984
Aggregation of nonnegative integervalued equations.
Discret. Appl. Math., 1984
1981
A New Optimization Method for Large Scale Fixed Charge Transportation Problems.
Operations Research, 1981
1980
Technical Note  Equivalence of the 01 Integer Programming Problem to Discrete Generalized and Pure Networks.
Operations Research, 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
A o(n logn) algorithm for LP knapsacks with GUB constraints.
Math. Program., 1979
A Strongly Convergent Primal Simplex Algorithm for Generalized Networks.
Math. Oper. Res., 1979
1978
Letter to the Editor  Comments on a Note by Hatch on Network Algorithms.
Operations Research, 1978
1977
Compact LP bases for a class of IP problems.
Math. Program., 1977
The alternating basis algorithm for assignment problems.
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
New results on equivalent integer programming formulations.
Math. Program., 1975
Polyhedral annexation in mixed integer and combinatorial programming.
Math. Program., 1975
Surrogate Constraint Duality in Mathematical Programming.
Operations Research, 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
Polyhedral convexity cuts and negative edge extensions.
Zeitschr. für OR, 1974
Technical Note  Converting the 01 Polynomial Programming Problem to a 01 Linear Program.
Operations Research, 1974
The DisjunctiveFacet Problem: Formulation and Solution Techniques.
Operations Research, 1974
First facets of the octahedron.
Discret. Math., 1974
1973
On the equivalence of some generalized network problems to pure network problems.
Math. Program., 1973
Further Reduction of ZeroOne Polynomial Programming Problems to ZeroOne linear Programming Problems.
Operations Research, 1973
The Generalized LatticePoint Problem.
Operations Research, 1973
Concave Programming Applied to a Special Class of 01 Integer Programs.
Operations Research, 1973
Convexity Cuts and Cut Search.
Operations Research, 1973
Convexity cuts for multiple choice problems.
Discret. Math., 1973
A note on computational studies for solving transportation problems.
Proceedings of the ACM annual conference, Atlanta, Georgia, USA, August 2729, 1973, 1973
1972
Cut search methods in integer programming.
Math. Program., 1972
Aggregating diophantine equations.
Zeitschr. für OR, 1972
Basic Dual Feasible Solutions for a Class of Generalized Networks.
Operations Research, 1972
Technical Note  A Note on ZeroOne Integer and Concave Programming.
Operations Research, 1972
1971
A Note on ExtremePoint Solutions and A Paper by Lemke, Salkin, and Spielberg.
Operations Research, 1971
An Intersection Cut from the Dual of the Unit Hypercube.
Operations Research, 1971
1970
Letter to the Editor  A Note on a Distribution Problem.
Operations Research, 1970
1968
A Note on Linear Programming and Integer Feasibility.
Operations Research, 1968
Surrogate Constraints.
Operations Research, 1968
A New Foundation for a Simplified Primal Integer Programming Algorithm.
Operations Research, 1968
1967
Letter to the Editor  Stronger Cuts in Integer Programming.
Operations Research, 1967