Gary A. Kochenberger

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Jin-Kao Hao

> Home > Persons > Gary A. Kochenberger

Publications

2014
[j41]
- view
  authority control:
- export record
  dblp key:
  - journals/jco/KochenbergerHGLLWW14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jco/KochenbergerHGLLWW14
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
[j39]
- view
  authority control:
- export record
  dblp key:
  - journals/heuristics/KochenbergerHLWG13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/heuristics/KochenbergerHLWG13
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)
2011
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/ijmheur/GloverHK11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijmheur/GloverHK11
Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 1. Int. J. Metaheuristics 1(3): 232-256 (2011)
[j35]
- view
  authority control:
- export record
  dblp key:
  - journals/ijmheur/GloverHK11a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijmheur/GloverHK11a
Fred W. Glover, Jin-Kao Hao, Gary A. Kochenberger:
Polynomial unconstrained binary optimisation - Part 2. Int. J. Metaheuristics 1(4): 317-354 (2011)

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.