Gary Kochenberger
Gary Kochenberger
Verified email at
Cited by
Cited by
Handbook of metaheuristics
FW Glover, GA Kochenberger
Springer Science & Business Media, 2006
Two‐piece von Neumann‐Morgenstern utility functions
PC Fishburn, GA Kochenberger
Decision Sciences 10 (4), 503-518, 1979
Critical event tabu search for multidimensional knapsack problems
F Glover, GA Kochenberger
Meta-heuristics, 407-427, 1996
Adaptive memory tabu search for binary quadratic programs
F Glover, GA Kochenberger, B Alidaee
Management Science 44 (3), 336-345, 1998
The unconstrained binary quadratic programming problem: a survey
G Kochenberger, JK Hao, F Glover, M Lewis, Z Lü, H Wang, Y Wang
Journal of combinatorial optimization 28 (1), 58-81, 2014
A unified modeling and solution framework for combinatorial optimization problems
GA Kochenberger, F Glover, B Alidaee, C Rego
OR Spectrum 26 (2), 237-250, 2004
A heuristic for general integer programming
GA Kochenberger, BA McCarl, F Paul Wyman
Decision Sciences 5 (1), 36-44, 1974
0-1 quadratic programming approach for optimum solutions of two scheduling problems
B Alidaee, GA Kochenberger, A Ahmadian
International Journal of Systems Science 25 (2), 401-408, 1994
Simulation optimization: applications in risk management
M Better, F Glover, G Kochenberger, H Wang
International Journal of Information Technology & Decision Making 7 (04 …, 2008
Solving the maximum edge weight clique problem via unconstrained quadratic programming
B Alidaee, F Glover, G Kochenberger, H Wang
European Journal of Operational Research 181 (2), 592-597, 2007
One-pass heuristics for large-scale unconstrained binary quadratic problems
F Glover, B Alidaee, C Rego, G Kochenberger
European Journal of Operational Research 137 (2), 272-287, 2002
Tabu search with critical event memory: an enhanced application for binary quadratic programs
F Glover, G Kochenberger, B Alidaee, M Amini
Meta-Heuristics, 93-109, 1999
A scatter search approach to unconstrained quadratic binary programs
MM Amini, B Alidaee, GA Kochenberger
New ideas in optimization, 317-330, 1999
An unconstrained quadratic binary programming approach to the vertex coloring problem
GA Kochenberger, F Glover, B Alidaee, C Rego
Annals of Operations Research 139 (1), 229-241, 2005
Clustering of microarray data via clique partitioning
G Kochenberger, F Glover, B Alidaee, H Wang
Journal of Combinatorial Optimization 10 (1), 77-92, 2005
Solving large scale max cut problems via tabu search
GA Kochenberger, JK Hao, Z Lü, H Wang, F Glover
Journal of Heuristics 19 (4), 565-571, 2013
A new modeling and solution approach for the set-partitioning problem
M Lewis, G Kochenberger, B Alidaee
Computers & Operations Research 35 (3), 807-813, 2008
A tutorial on formulating and using QUBO models
F Glover, G Kochenberger, Y Du
arXiv preprint arXiv:1811.11538, 2018
Solving group technology problems via clique partitioning
H Wang, B Alidaee, F Glover, G Kochenberger
International Journal of Flexible Manufacturing Systems 18 (2), 77-97, 2006
A new approach for modeling and solving set packing problems
B Alidaee, G Kochenberger, K Lewis, M Lewis, H Wang
European Journal of Operational Research 186 (2), 504-512, 2008
The system can't perform the operation now. Try again later.
Articles 1–20