On "a cofferdam design optimization". - John J. Dinkel; Gary A. Kochenberger (Math. Program., 1974)

An approach to the numerical solutions of geometric programs. - John J. Dinkel; Gary A. Kochenberger; Bruce McCarl (Math. Program., 1974)

Environmental inspection routes and the constrained travelling system salesman problem. - John J. Dinkel; George B. Kleindorfer; Gary A. Kochenberger; S. N. Wong (Comput. Oper. Res., 1976)

Technical Note - On Sensitivity Analysis in Geometric Programming. - John J. Dinkel; Gary A. Kochenberger (Oper. Res., 1977)

Computational aspects of cutting-plane algorithms for geometric programming problems. - John J. Dinkel; William H. Elliott; Gary A. Kochenberger (Math. Program., 1977)

Resource allocation in computer networks by a regional accessibility model. - John J. Dinkel; Gary A. Kochenberger; Y. Seppälä (Comput. Oper. Res., 1978)

Technical Note - An Implementation of Surrogate Constraint Duality. - John J. Dinkel; Gary A. Kochenberger (Oper. Res., 1978)

An implementation of some implicit function theorems with applications to sensitivity analysis. - John J. Dinkel; Gary A. Kochenberger (Math. Program., 1978)

Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects. - John J. Dinkel; Gary A. Kochenberger; S. N. Wong (ACM Trans. Math. Softw., 1978)

Some remarks on condensation methods for geometric programs. - John J. Dinkel; Gary A. Kochenberger (Math. Program., 1979)

Computing inter-site distances for routing and scheduling problems. - George B. Kleindorfer; Gary A. Kochenberger; Edward T. Reutzel (Oper. Res. Lett., 1981)

A simple, all primal branch and bound approach to pure and mixed integer binary programs. - Gary A. Kochenberger; Victor H. Richard (Oper. Res. Lett., 1982)

Greedy solutions of selection and ordering problems. - Bahram Alidaee; Gary A. Kochenberger; Mohammad M. Amini (Eur. J. Oper. Res., 2001)

One-pass heuristics for large-scale unconstrained binary quadratic problems. - Fred W. Glover; Bahram Alidaee; César Rego; Gary A. Kochenberger (Eur. J. Oper. Res., 2002)

An Effective Approach for Solving the Binary Assignment Problem with Side Constraints. - Gary A. Kochenberger; Fred W. Glover; Bahram Alidaee (Int. J. Inf. Technol. Decis. Mak., 2002)

Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining. - Haibo Wang 001; Bahram Alidaee; Gary A. Kochenberger (AMCIS, 2004)

An Interactive Clustering Methodology for High Dimensional Data Mining. - Haibo Wang 001; Bahram Alidaee; Fred W. Glover; Gary A. Kochenberger (PACIS, 2004)

A unified modeling and solution framework for combinatorial optimization problems. - Gary A. Kochenberger; Fred W. Glover; Bahram Alidaee; César Rego (OR Spectr., 2004)

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem. - Gary A. Kochenberger; Fred W. Glover; Bahram Alidaee; César Rego (Ann. Oper. Res., 2005)

A new modeling and solution approach for the number partitioning problem. - Bahram Alidaee; Fred W. Glover; Gary A. Kochenberger; César Rego (Adv. Decis. Sci., 2005)

Clustering of Microarray data via Clique Partitioning. - Gary A. Kochenberger; Fred W. Glover; Bahram Alidaee; Haibo Wang 001 (J. Comb. Optim., 2005)

Using xQx to model and solve the uncapacitated task allocation problem. - Mark W. Lewis; Bahram Alidaee; Gary A. Kochenberger (Oper. Res. Lett., 2005)

A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem. - Bahram Alidaee; Gary A. Kochenberger (Transp. Sci., 2005)

New Optimization Models for Data Mining. - Fred W. Glover; Gary A. Kochenberger (Int. J. Inf. Technol. Decis. Mak., 2006)

Solving the maximum edge weight clique problem via unconstrained quadratic programming. - Bahram Alidaee; Fred W. Glover; Gary A. Kochenberger; Haibo Wang 001 (Eur. J. Oper. Res., 2007)

An effective modeling and solution approach for the generalized independent set problem. - Gary A. Kochenberger; Bahram Alidaee; Fred W. Glover; Haibo Wang 001 (Optim. Lett., 2007)

A new modeling and solution approach for the set-partitioning problem. - Mark W. Lewis; Gary A. Kochenberger; Bahram Alidaee (Comput. Oper. Res., 2008)

Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis. - Haibo Wang 001; Tom Obremski; Bahram Alidaee; Gary A. Kochenberger (Commun. Stat. Simul. Comput., 2008)

A new approach for modeling and solving set packing problems. - Bahram Alidaee; Gary A. Kochenberger; Karen R. Lewis; Mark W. Lewis; Haibo Wang 001 (Eur. J. Oper. Res., 2008)

Simple and fast surrogate constraint heuristics for the maximum independent set problem. - Bahram Alidaee; Gary A. Kochenberger; Haibo Wang 001 (J. Heuristics, 2008)

Simulation Optimization: Applications in Risk Management. - Marco Better; Fred W. Glover; Gary A. Kochenberger; Haibo Wang 001 (Int. J. Inf. Technol. Decis. Mak., 2008)

Solving the market split problem via branch-and-cut. - Haibo Wang 001; Gary A. Kochenberger; Bahram Alidaee; Mark W. Lewis (Int. J. Math. Model. Numer. Optimisation, 2009)

Computationally attractive non-linear models for combinatorial optimisation. - Bahram Alidaee; Gary A. Kochenberger; Karen R. Lewis; Mark W. Lewis; Haibo Wang 001 (Int. J. Math. Oper. Res., 2009)

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization. - Bahram Alidaee; Gary A. Kochenberger; Haibo Wang 001 (Int. J. Appl. Metaheuristic Comput., 2010)

A two-stage approach to solving large capacitated task allocation problems. - Mark W. Lewis; Gary A. Kochenberger (Int. J. Math. Model. Numer. Optimisation, 2010)

A note on optimal solutions to quadratic knapsack problems. - Haibo Wang 001; Gary A. Kochenberger; Yaquan Xu (Int. J. Math. Model. Numer. Optimisation, 2010)

Polynomial unconstrained binary optimisation - Part 1. - Fred W. Glover; Jin-Kao Hao; Gary A. Kochenberger (Int. J. Metaheuristics, 2011)

Polynomial unconstrained binary optimisation - Part 2. - Fred W. Glover; Jin-Kao Hao; Gary A. Kochenberger (Int. J. Metaheuristics, 2011)

A computational study on the quadratic knapsack problem with multiple constraints. - Haibo Wang 001; Gary A. Kochenberger; Fred W. Glover (Comput. Oper. Res., 2012)

Introduction to special xQx issue. - Gary A. Kochenberger; Fred W. Glover (J. Heuristics, 2013)

Solving large scale Max Cut problems via tabu search. - Gary A. Kochenberger; Jin-Kao Hao; Zhipeng Lü; Haibo Wang 001; Fred W. Glover (J. Heuristics, 2013)

Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation. - Mark W. Lewis; Gary A. Kochenberger (Int. J. Inf. Technol. Decis. Mak., 2013)

The unconstrained binary quadratic programming problem: a survey. - Gary A. Kochenberger; Jin-Kao Hao; Fred W. Glover; Mark W. Lewis; Zhipeng Lü; Haibo Wang 001; Yang Wang 030 (J. Comb. Optim., 2014)

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. - Fred W. Glover; Tao Ye; Abraham P. Punnen; Gary A. Kochenberger (Eur. J. Oper. Res., 2015)

Exact solutions to generalized vertex covering problems: a comparison of two models. - Gary A. Kochenberger; Mark W. Lewis; Fred W. Glover; Haibo Wang 001 (Optim. Lett., 2015)

An ejection chain approach for the quadratic multiple knapsack problem. - Bo Peng 010; Mengqi Liu; Zhipeng Lü; Gary A. Kochenberger; Haibo Wang 001 (Eur. J. Oper. Res., 2016)

Preface. - Gary A. Kochenberger; Fred W. Glover (Networks, 2016)

Preface to the 2nd Special Issue on metaheuristics in network optimization. - Gary A. Kochenberger; Fred W. Glover (Networks, 2016)

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems. - Fred W. Glover; Mark W. Lewis; Gary A. Kochenberger (CoRR, 2017)

Robust Optimization of Unconstrained Binary Quadratic Problems. - Mark W. Lewis; Gary A. Kochenberger; John Metcalfe (CoRR, 2017)

A Tutorial on Formulating QUBO Models. - Fred W. Glover; Gary A. Kochenberger (CoRR, 2018)

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. - Fred W. Glover; Mark W. Lewis; Gary A. Kochenberger (Eur. J. Oper. Res., 2018)

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. - Fred W. Glover; Gary A. Kochenberger; Yu Du 003 (4OR, 2019)

Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange. - Fred W. Glover; Gary A. Kochenberger; Moses Ma; Yu Du 003 (CoRR, 2019)

Diversification methods for zero-one optimization. - Fred W. Glover; Gary A. Kochenberger; Weihong Xie; Jianbin Luo (J. Heuristics, 2019)

Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange. - Fred W. Glover; Gary A. Kochenberger; Moses Ma; Yu Du 003 (4OR, 2020)

A Self-Organizing Extreme-Point Tabu-Search Algorithm for Fixed Charge Network Problems with Extensions. - Richard S. Barr; Fred W. Glover; Toby Huskinson; Gary A. Kochenberger (CoRR, 2020)

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions. - Amit Verma; Mark W. Lewis; Gary A. Kochenberger (CoRR, 2021)

An extreme-point tabu-search algorithm for fixed-charge network problems. - Richard S. Barr; Fred W. Glover; Toby Huskinson; Gary A. Kochenberger (Networks, 2021)

Quantum bridge analytics I: a tutorial on formulating and using QUBO models. - Fred W. Glover; Gary A. Kochenberger; Rick Hennig; Yu Du 003 (Ann. Oper. Res., 2022)

Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. - Yu Du 003; Gary A. Kochenberger; Fred W. Glover; Haibo Wang 001; Mark W. Lewis; Weihong Xie; Takeshi Tsuyuguchi (Int. J. Inf. Technol. Decis. Mak., 2022)

Solving the Minimum Sum Coloring Problem: Alternative Models, Exact Solvers, and Metaheuristics. - Yu Du 003; Fred W. Glover; Gary A. Kochenberger; Rick Hennig; Haibo Wang 001; Amit Hulandageri (INFORMS J. Comput., 2025)

New advances for quantum-inspired optimization. - Yu Du 003; Haibo Wang 001; Rick Hennig; Amit Hulandageri; Gary A. Kochenberger; Fred W. Glover (Int. Trans. Oper. Res., 2025)