Gary A. Kochenberger - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 57 from 57

2025

Solving the Minimum Sum Coloring Problem: Alternative Models, Exact Solvers, and MetaheuristicsYu Du 0003, Fred W. Glover, Gary A. Kochenberger, Rick Hennig, Haibo Wang 0001, Amit Hulandageri. informs, 37(2):199-211, 2025. [doi]

New advances for quantum-inspired optimizationYu Du, Haibo Wang 0001, Rick Hennig, Amit Hulandageri, Gary A. Kochenberger, Fred W. Glover. itor, 32(1):6-17, January 2025. [doi]

2022

2021

An extreme-point tabu-search algorithm for fixed-charge network problemsRichard S. Barr, Fred W. Glover, Toby Huskinson, Gary A. Kochenberger. networks, 77(2):322-340, 2021. [doi]

2020

Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchangeFred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du. 4or, 18(4):387-417, 2020. [doi]

2019

Diversification methods for zero-one optimizationFred W. Glover, Gary A. Kochenberger, Weihong Xie, Jianbin Luo. heuristics, 25(4-5):643-671, 2019. [doi]

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO modelsFred W. Glover, Gary A. Kochenberger, Yu Du. 4or, 17(4):335-371, 2019. [doi]

2018

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problemsFred Glover, Mark W. Lewis, Gary A. Kochenberger. eor, 265(3):829-842, 2018. [doi]

2016

PrefaceGary A. Kochenberger, Fred Glover. networks, 67(3):185-186, 2016. [doi]

nd Special Issue on metaheuristics in network optimizationGary A. Kochenberger, Fred Glover. networks, 68(1):3, 2016. [doi]

2015

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programsFred Glover, Tao Ye, Abraham P. Punnen, Gary A. Kochenberger. eor, 241(3):697-707, 2015. [doi]

Exact solutions to generalized vertex covering problems: a comparison of two modelsGary A. Kochenberger, Mark W. Lewis, Fred Glover, Haibo Wang. ol, 9(7):1331-1339, 2015. [doi]

2014

The unconstrained binary quadratic programming problem: a surveyGary A. Kochenberger, Jin-Kao Hao, Fred Glover, Mark Lewis, Zhipeng Lü, Haibo Wang, Yang Wang. jco, 28(1):58-81, 2014. [doi]

2013

Introduction to special xQx issueGary A. Kochenberger, Fred Glover. heuristics, 19(4):525-528, 2013. [doi]

Solving large scale Max Cut problems via tabu searchGary A. Kochenberger, Jin-Kao Hao, Zhipeng Lü, Haibo Wang, Fred Glover. heuristics, 19(4):565-571, 2013. [doi]

Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task AllocationMark Lewis, Gary A. Kochenberger. ijitdm, 12(2):261-276, 2013. [doi]

2012

A computational study on the quadratic knapsack problem with multiple constraintsHaibo Wang, Gary A. Kochenberger, Fred Glover. cor, 39(1):3-11, 2012. [doi]

2011

Polynomial unconstrained binary optimisation - Part 1Fred Glover, Jin-Kao Hao, Gary A. Kochenberger. ijmheur, 1(3):232-256, 2011. [doi]

Polynomial unconstrained binary optimisation - Part 2Fred Glover, Jin-Kao Hao, Gary A. Kochenberger. ijmheur, 1(4):317-354, 2011. [doi]

2010

Theorems Supporting r-flip Search for Pseudo-Boolean OptimizationBahram Alidaee, Gary A. Kochenberger, Haibo Wang. ijamc-igi, 1(1):93-109, 2010. [doi]

A two-stage approach to solving large capacitated task allocation problemsMark Lewis, Gary A. Kochenberger. ijmno, 1(4):259-273, 2010. [doi]

A note on optimal solutions to quadratic knapsack problemsHaibo Wang, Gary A. Kochenberger, Yaquan Xu. ijmno, 1(4):344-351, 2010. [doi]

2009

Computationally attractive non-linear models for combinatorial optimisationBahram Alidaee, Gary A. Kochenberger, Karen R. Lewis, Mark W. Lewis, Haibo Wang. ijmor, 1(1/2):9-19, 2009. [doi]

Solving the market split problem via branch-and-cutHaibo Wang, Gary A. Kochenberger, Bahram Alidaee, Mark Lewis. ijmno, 1(1/2):121-127, 2009. [doi]

2008

2007

Solving the maximum edge weight clique problem via unconstrained quadratic programmingBahram Alidaee, Fred Glover, Gary A. Kochenberger, Haibo Wang. eor, 181(2):592-597, 2007. [doi]

An effective modeling and solution approach for the generalized independent set problemGary A. Kochenberger, Bahram Alidaee, Fred Glover, Haibo Wang. ol, 1(1):111-117, 2007. [doi]

2006

New Optimization Models for Data MiningFred Glover, Gary A. Kochenberger. ijitdm, 5(4):605-610, 2006. [doi]

2005

A Note on a Simple Dynamic Programming Approach to the Single-Sink, Fixed-Charge Transportation ProblemBahram Alidaee, Gary A. Kochenberger. transci, 39(1):140-143, 2005. [doi]

A new modeling and solution approach for the number partitioning problemBahram Alidaee, Fred Glover, Gary A. Kochenberger, César Rego. jamds, 9(2):113-121, 2005. [doi]

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring ProblemGary A. Kochenberger, Fred Glover, Bahram Alidaee, César Rego. anor, 139(1):229-241, 2005. [doi]

Clustering of Microarray data via Clique PartitioningGary A. Kochenberger, Fred Glover, Bahram Alidaee, Haibo Wang. jco, 10(1):77-92, 2005. [doi]

Using ::::xQx:::: to model and solve the uncapacitated task allocation problemMark Lewis, Bahram Alidaee, Gary A. Kochenberger. orl, 33(2):176-182, 2005. [doi]

2004

2002

One-pass heuristics for large-scale unconstrained binary quadratic problemsFred Glover, Bahram Alidaee, César Rego, Gary A. Kochenberger. eor, 137(2):272-287, 2002. [doi]

An Effective Approach for Solving the Binary Assignment Problem with Side ConstraintsGary A. Kochenberger, Fred Glover, Bahram Alidaee. ijitdm, 1(1):121-129, 2002. [doi]

2001

Greedy solutions of selection and ordering problemsBahram Alidaee, Gary A. Kochenberger, Mohammad M. Amini. eor, 134(1):203-215, 2001. [doi]

1982

A simple, all primal branch and bound approach to pure and mixed integer binary programsGary A. Kochenberger, Victor H. Richard. orl, 1(5):182-185, 1982. [doi]

1981

Computing inter-site distances for routing and scheduling problemsGeorge B. Kleindorfer, Gary A. Kochenberger, Edward T. Reutzel. orl, 1(1):31-33, 1981. [doi]

1979

Some remarks on condensation methods for geometric programsJohn J. Dinkel, Gary A. Kochenberger. mp, 17(1):109-113, 1979. [doi]

1978

1977

Computational aspects of cutting-plane algorithms for geometric programming problemsJohn J. Dinkel, William H. Elliott, Gary A. Kochenberger. mp, 13(1):200-220, 1977. [doi]

Technical Note - On Sensitivity Analysis in Geometric ProgrammingJohn J. Dinkel, Gary A. Kochenberger. ior, 25(1):155-163, 1977. [doi]

1976

Environmental inspection routes and the constrained travelling system salesman problemJohn J. Dinkel, George B. Kleindorfer, Gary A. Kochenberger, S. N. Wong. cor, 3(4):269-282, 1976. [doi]

1974

An approach to the numerical solutions of geometric programsJohn J. Dinkel, Gary A. Kochenberger, Bruce McCarl. mp, 7(1):181-190, 1974. [doi]

On "a cofferdam design optimization"John J. Dinkel, Gary A. Kochenberger. mp, 6(1):114-116, 1974. [doi]

All Publications

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1

Researchr

Publications by 'Gary A. Kochenberger'

Viewing Publication 1 - 57 from 57

2025

2022

2021

2020

2019

2018

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001

1982

1981

1979

1978

1977

1976

1974

All Publications

Filter by Year [-]OR AND NOT 1

Filter by TypeOR AND NOT 1

Filter by TagOR AND NOT 1

Filter by Venue [+]OR AND NOT 1

Filter by Author [+]OR AND NOT 1

Filter by Top Terms [+]OR AND NOT 1

Researchr

Publications by 'Gary A. Kochenberger'

Viewing Publication 1 - 57 from 57

2025

2022

2021

2020

2019

2018

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2002

2001

1982

1981

1979

1978

1977

1976

1974

Filter by Year

[-]
OR AND NOT 1

Filter by Type
OR AND NOT 1

Filter by Tag
OR AND NOT 1

Filter by Venue

[+]
OR AND NOT 1

Filter by Author

[+]
OR AND NOT 1

Filter by Top Terms

[+]
OR AND NOT 1