Gary A. Kochenberger

According to our database1, Gary A. Kochenberger authored at least 62 papers between 1974 and 2025.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
New advances for quantum-inspired optimization.
Int. Trans. Oper. Res., January, 2025

2022
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers.
Int. J. Inf. Technol. Decis. Mak., 2022

Quantum bridge analytics I: a tutorial on formulating and using QUBO models.
Ann. Oper. Res., 2022

2021
An extreme-point tabu-search algorithm for fixed-charge network problems.
Networks, 2021

Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions.
CoRR, 2021

2020
A Self-Organizing Extreme-Point Tabu-Search Algorithm for Fixed Charge Network Problems with Extensions.
CoRR, 2020

Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange.
4OR, 2020

2019
Diversification methods for zero-one optimization.
J. Heuristics, 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

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

2017
Robust Optimization of Unconstrained Binary Quadratic Problems.
CoRR, 2017

Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems.
CoRR, 2017

2016
Preface to the 2<sup>nd</sup> Special Issue on metaheuristics in network optimization.
Networks, 2016

Preface.
Networks, 2016

An ejection chain approach for the quadratic multiple knapsack problem.
Eur. J. Oper. Res., 2016

2015
Exact solutions to generalized vertex covering problems: a comparison of two models.
Optim. Lett., 2015

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.
Eur. J. Oper. Res., 2015

2014
The unconstrained binary quadratic programming problem: a survey.
J. Comb. Optim., 2014

2013
Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation.
Int. J. Inf. Technol. Decis. Mak., 2013

Solving large scale Max Cut problems via tabu search.
J. Heuristics, 2013

Introduction to special xQx issue.
J. Heuristics, 2013

2012
A computational study on the quadratic knapsack problem with multiple constraints.
Comput. Oper. Res., 2012

2011
Polynomial unconstrained binary optimisation - Part 2.
Int. J. Metaheuristics, 2011

Polynomial unconstrained binary optimisation - Part 1.
Int. J. Metaheuristics, 2011

2010
A note on optimal solutions to quadratic knapsack problems.
Int. J. Math. Model. Numer. Optimisation, 2010

A two-stage approach to solving large capacitated task allocation problems.
Int. J. Math. Model. Numer. Optimisation, 2010

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization.
Int. J. Appl. Metaheuristic Comput., 2010

2009
Computationally attractive non-linear models for combinatorial optimisation.
Int. J. Math. Oper. Res., 2009

Solving the market split problem via branch-and-cut.
Int. J. Math. Model. Numer. Optimisation, 2009

2008
Simulation Optimization: Applications in Risk Management.
Int. J. Inf. Technol. Decis. Mak., 2008

Simple and fast surrogate constraint heuristics for the maximum independent set problem.
J. Heuristics, 2008

A new approach for modeling and solving set packing problems.
Eur. J. Oper. Res., 2008

Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis.
Commun. Stat. Simul. Comput., 2008

A new modeling and solution approach for the set-partitioning problem.
Comput. Oper. Res., 2008

2007
An effective modeling and solution approach for the generalized independent set problem.
Optim. Lett., 2007

Solving the maximum edge weight clique problem via unconstrained quadratic programming.
Eur. J. Oper. Res., 2007

2006
New Optimization Models for Data Mining.
Int. J. Inf. Technol. Decis. Mak., 2006

2005
A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem.
Transp. Sci., 2005

Using <i>xQx</i> to model and solve the uncapacitated task allocation problem.
Oper. Res. Lett., 2005

Clustering of Microarray data via Clique Partitioning.
J. Comb. Optim., 2005

A new modeling and solution approach for the number partitioning problem.
Adv. Decis. Sci., 2005

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.
Ann. Oper. Res., 2005

2004
A unified modeling and solution framework for combinatorial optimization problems.
OR Spectr., 2004

An Interactive Clustering Methodology for High Dimensional Data Mining.
Proceedings of the Pacific Asia Conference on Information Systems, 2004

Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining.
Proceedings of the 10th Americas Conference on Information Systems, 2004

2002
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints.
Int. J. Inf. Technol. Decis. Mak., 2002

One-pass heuristics for large-scale unconstrained binary quadratic problems.
Eur. J. Oper. Res., 2002

2001
Greedy solutions of selection and ordering problems.
Eur. J. Oper. Res., 2001

1982
A simple, all primal branch and bound approach to pure and mixed integer binary programs.
Oper. Res. Lett., 1982

1981
Computing inter-site distances for routing and scheduling problems.
Oper. Res. Lett., 1981

1979
Some remarks on condensation methods for geometric programs.
Math. Program., 1979

1978
Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects.
ACM Trans. Math. Softw., 1978

An implementation of some implicit function theorems with applications to sensitivity analysis.
Math. Program., 1978

Technical Note - An Implementation of Surrogate Constraint Duality.
Oper. Res., 1978

Resource allocation in computer networks by a regional accessibility model.
Comput. Oper. Res., 1978

1977
Computational aspects of cutting-plane algorithms for geometric programming problems.
Math. Program., 1977

Technical Note - On Sensitivity Analysis in Geometric Programming.
Oper. Res., 1977

1976
Environmental inspection routes and the constrained travelling system salesman problem.
Comput. Oper. Res., 1976

1974
An approach to the numerical solutions of geometric programs.
Math. Program., 1974

On "a cofferdam design optimization".
Math. Program., 1974


  Loading...