default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGary A. Kochenberger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j55]Yu Du
, Haibo Wang, Rick Hennig, Amit Hulandageri, Gary A. Kochenberger, Fred W. Glover:
New advances for quantum-inspired optimization. Int. Trans. Oper. Res. 32(1): 6-17 (2025)- 2022
- [j54]Fred W. Glover, Gary A. Kochenberger, Rick Hennig, Yu Du:
Quantum bridge analytics I: a tutorial on formulating and using QUBO models. Ann. Oper. Res. 314(1): 141-183 (2022) - [j53]Fred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du:
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange. Ann. Oper. Res. 314(1): 185-212 (2022) - [j52]Yu Du, Gary A. Kochenberger, Fred W. Glover, Haibo Wang, Mark W. Lewis, Weihong Xie, Takeshi Tsuyuguchi:
Solving Clique Partitioning Problems: A Comparison of Models and Commercial Solvers. Int. J. Inf. Technol. Decis. Mak. 21(1): 59-81 (2022) - 2021
- [j51]Richard S. Barr, Fred W. Glover, Toby Huskinson, Gary A. Kochenberger:
An extreme-point tabu-search algorithm for fixed-charge network problems. Networks 77(2): 322-340 (2021) - 2020
- [j50]Fred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du:
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange. 4OR 18(4): 387-417 (2020) - 2019
- [j49]Fred W. Glover, Gary A. Kochenberger, Yu Du:
Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models. 4OR 17(4): 335-371 (2019) - [j48]Fred W. Glover, Gary A. Kochenberger, Weihong Xie, Jianbin Luo:
Diversification methods for zero-one optimization. J. Heuristics 25(4-5): 643-671 (2019) - 2018
- [j47]Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger:
Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems. Eur. J. Oper. Res. 265(3): 829-842 (2018) - 2016
- [j46]Bo Peng, Mengqi Liu, Zhipeng Lü, Gary A. Kochenberger, Haibo Wang:
An ejection chain approach for the quadratic multiple knapsack problem. Eur. J. Oper. Res. 253(2): 328-336 (2016) - [j45]Gary A. Kochenberger, Fred W. Glover:
Preface. Networks 67(3): 185-186 (2016) - [j44]Gary A. Kochenberger, Fred W. Glover:
Preface to the 2nd Special Issue on metaheuristics in network optimization. Networks 68(1): 3 (2016) - 2015
- [j43]Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger:
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. Eur. J. Oper. Res. 241(3): 697-707 (2015) - [j42]Gary A. Kochenberger, Mark W. Lewis, Fred W. Glover, Haibo Wang:
Exact solutions to generalized vertex covering problems: a comparison of two models. Optim. Lett. 9(7): 1331-1339 (2015) - 2014
- [j41]Gary A. Kochenberger, Jin-Kao Hao, Fred W. Glover, Mark W. Lewis, Zhipeng Lü, Haibo Wang, Yang Wang:
The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1): 58-81 (2014) - 2013
- [j40]Gary A. Kochenberger, Fred W. Glover:
Introduction to special xQx issue. J. Heuristics 19(4): 525-528 (2013) - [j39]Gary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang, Fred W. Glover:
Solving large scale Max Cut problems via tabu search. J. Heuristics 19(4): 565-571 (2013) - [j38]Mark W. Lewis, Gary A. Kochenberger:
Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation. Int. J. Inf. Technol. Decis. Mak. 12(2): 261-276 (2013) - 2012
- [j37]Haibo Wang, Gary A. Kochenberger, Fred W. Glover:
A computational study on the quadratic knapsack problem with multiple constraints. Comput. Oper. Res. 39(1): 3-11 (2012) - 2011
- [j36]Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 1. Int. J. Metaheuristics 1(3): 232-256 (2011) - [j35]Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 2. Int. J. Metaheuristics 1(4): 317-354 (2011) - 2010
- [j34]Bahram Alidaee, Gary A. Kochenberger, Haibo Wang:
Theorems Supporting r-flip Search for Pseudo-Boolean Optimization. Int. J. Appl. Metaheuristic Comput. 1(1): 93-109 (2010) - [j33]Mark W. Lewis, Gary A. Kochenberger:
A two-stage approach to solving large capacitated task allocation problems. Int. J. Math. Model. Numer. Optimisation 1(4): 259-273 (2010) - [j32]Haibo Wang, Gary A. Kochenberger, Yaquan Xu:
A note on optimal solutions to quadratic knapsack problems. Int. J. Math. Model. Numer. Optimisation 1(4): 344-351 (2010) - 2009
- [j31]Haibo Wang, Gary A. Kochenberger, Bahram Alidaee, Mark W. Lewis:
Solving the market split problem via branch-and-cut. Int. J. Math. Model. Numer. Optimisation 1(1/2): 121-127 (2009) - [j30]Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang:
Computationally attractive non-linear models for combinatorial optimisation. Int. J. Math. Oper. Res. 1(1/2): 9-19 (2009) - 2008
- [j29]Mark W. Lewis, Gary A. Kochenberger, Bahram Alidaee:
A new modeling and solution approach for the set-partitioning problem. Comput. Oper. Res. 35(3): 807-813 (2008) - [j28]Haibo Wang, Tom Obremski, Bahram Alidaee, Gary A. Kochenberger:
Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis. Commun. Stat. Simul. Comput. 37(1): 1-13 (2008) - [j27]Bahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang:
A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186(2): 504-512 (2008) - [j26]Bahram Alidaee, Gary A. Kochenberger, Haibo Wang:
Simple and fast surrogate constraint heuristics for the maximum independent set problem. J. Heuristics 14(6): 571-585 (2008) - [j25]Marco Better, Fred W. Glover, Gary A. Kochenberger, Haibo Wang:
Simulation Optimization: Applications in Risk Management. Int. J. Inf. Technol. Decis. Mak. 7(4): 571-587 (2008) - 2007
- [j24]Bahram Alidaee, Fred W. Glover, Gary A. Kochenberger, Haibo Wang:
Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur. J. Oper. Res. 181(2): 592-597 (2007) - [j23]Gary A. Kochenberger, Bahram Alidaee, Fred W. Glover, Haibo Wang:
An effective modeling and solution approach for the generalized independent set problem. Optim. Lett. 1(1): 111-117 (2007) - 2006
- [j22]Fred W. Glover, Gary A. Kochenberger:
New Optimization Models for Data Mining. Int. J. Inf. Technol. Decis. Mak. 5(4): 605-610 (2006) - 2005
- [j21]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, César Rego:
An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem. Ann. Oper. Res. 139(1): 229-241 (2005) - [j20]Bahram Alidaee, Fred W. Glover, Gary A. Kochenberger, César Rego:
A new modeling and solution approach for the number partitioning problem. Adv. Decis. Sci. 9(2): 113-121 (2005) - [j19]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, Haibo Wang:
Clustering of Microarray data via Clique Partitioning. J. Comb. Optim. 10(1): 77-92 (2005) - [j18]Mark W. Lewis, Bahram Alidaee, Gary A. Kochenberger:
Using xQx to model and solve the uncapacitated task allocation problem. Oper. Res. Lett. 33(2): 176-182 (2005) - [j17]Bahram Alidaee, Gary A. Kochenberger:
A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation Problem. Transp. Sci. 39(1): 140-143 (2005) - 2004
- [j16]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee, César Rego:
A unified modeling and solution framework for combinatorial optimization problems. OR Spectr. 26(2): 237-250 (2004) - 2002
- [j15]Fred W. Glover, Bahram Alidaee, César Rego, Gary A. Kochenberger:
One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur. J. Oper. Res. 137(2): 272-287 (2002) - [j14]Gary A. Kochenberger, Fred W. Glover, Bahram Alidaee:
An Effective Approach for Solving the Binary Assignment Problem with Side Constraints. Int. J. Inf. Technol. Decis. Mak. 1(1): 121-129 (2002) - 2001
- [j13]Bahram Alidaee, Gary A. Kochenberger, Mohammad M. Amini:
Greedy solutions of selection and ordering problems. Eur. J. Oper. Res. 134(1): 203-215 (2001) - 1982
- [j12]Gary A. Kochenberger, Victor H. Richard:
A simple, all primal branch and bound approach to pure and mixed integer binary programs. Oper. Res. Lett. 1(5): 182-185 (1982) - 1981
- [j11]George B. Kleindorfer, Gary A. Kochenberger, Edward T. Reutzel:
Computing inter-site distances for routing and scheduling problems. Oper. Res. Lett. 1(1): 31-33 (1981) - 1979
- [j10]John J. Dinkel, Gary A. Kochenberger:
Some remarks on condensation methods for geometric programs. Math. Program. 17(1): 109-113 (1979) - 1978
- [j9]John J. Dinkel, Gary A. Kochenberger, Y. Seppälä:
Resource allocation in computer networks by a regional accessibility model. Comput. Oper. Res. 5(2): 139-147 (1978) - [j8]John J. Dinkel, Gary A. Kochenberger:
Technical Note - An Implementation of Surrogate Constraint Duality. Oper. Res. 26(2): 358-364 (1978) - [j7]John J. Dinkel, Gary A. Kochenberger:
An implementation of some implicit function theorems with applications to sensitivity analysis. Math. Program. 15(1): 261-267 (1978) - [j6]John J. Dinkel, Gary A. Kochenberger, S. N. Wong:
Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects. ACM Trans. Math. Softw. 4(1): 1-14 (1978) - 1977
- [j5]John J. Dinkel, Gary A. Kochenberger:
Technical Note - On Sensitivity Analysis in Geometric Programming. Oper. Res. 25(1): 155-163 (1977) - [j4]John J. Dinkel, William H. Elliott, Gary A. Kochenberger:
Computational aspects of cutting-plane algorithms for geometric programming problems. Math. Program. 13(1): 200-220 (1977) - 1976
- [j3]John J. Dinkel, George B. Kleindorfer, Gary A. Kochenberger, S. N. Wong:
Environmental inspection routes and the constrained travelling system salesman problem. Comput. Oper. Res. 3(4): 269-282 (1976) - 1974
- [j2]John J. Dinkel, Gary A. Kochenberger:
On "a cofferdam design optimization". Math. Program. 6(1): 114-116 (1974) - [j1]John J. Dinkel, Gary A. Kochenberger, Bruce McCarl:
An approach to the numerical solutions of geometric programs. Math. Program. 7(1): 181-190 (1974)
Conference and Workshop Papers
- 2004
- [c2]Haibo Wang, Bahram Alidaee, Gary A. Kochenberger:
Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining. AMCIS 2004: 234 - [c1]Haibo Wang, Bahram Alidaee, Fred W. Glover, Gary A. Kochenberger:
An Interactive Clustering Methodology for High Dimensional Data Mining. PACIS 2004: 88
Editorship
- 2003
- [e1]Fred W. Glover, Gary A. Kochenberger:
Handbook of Metaheuristics. International Series in Operations Research & Management Science 57, Kluwer / Springer 2003, ISBN 978-1-4020-7263-5 [contents]
Informal and Other Publications
- 2021
- [i7]Amit Verma, Mark W. Lewis, Gary A. Kochenberger:
Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions. CoRR abs/2107.11695 (2021) - 2020
- [i6]Richard S. Barr, Fred W. Glover, Toby Huskinson, Gary A. Kochenberger:
A Self-Organizing Extreme-Point Tabu-Search Algorithm for Fixed Charge Network Problems with Extensions. CoRR abs/2007.06685 (2020) - 2019
- [i5]Fred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du:
Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange. CoRR abs/1911.03036 (2019) - 2018
- [i4]Fred W. Glover, Gary A. Kochenberger:
A Tutorial on Formulating QUBO Models. CoRR abs/1811.11538 (2018) - 2017
- [i3]Fred W. Glover, Mark W. Lewis, Gary A. Kochenberger:
Logical and Inequality Implications for Reducing the Size and Complexity of Quadratic Unconstrained Binary Optimization Problems. CoRR abs/1705.09545 (2017) - [i2]Mark W. Lewis, Gary A. Kochenberger, John Metcalfe:
Robust Optimization of Unconstrained Binary Quadratic Problems. CoRR abs/1709.07511 (2017) - 2013
- [i1]Fred W. Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger:
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs. CoRR abs/1305.5610 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
