Gary A. Kochenberger

CoRR, 2021

2020

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

[BibT_eX]

[DOI]

CoRR, 2020

2019

Diversification methods for zero-one optimization.

[BibT_eX]

[DOI]

J. Heuristics, 2019

Quantum Bridge Analytics II: Combinatorial Chaining for Asset Exchange.

[BibT_eX]

[DOI]

CoRR, 2019

Quantum Bridge Analytics I: a tutorial on formulating and using QUBO models.

[BibT_eX]

[DOI]

Yu Du

4OR, 2019

2018

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2018

A Tutorial on Formulating QUBO Models.

[BibT_eX]

[DOI]

CoRR, 2018

2017

Robust Optimization of Unconstrained Binary Quadratic Problems.

[BibT_eX]

[DOI]

John Metcalfe

CoRR, 2017

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

[BibT_eX]

[DOI]

CoRR, 2017

2016

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

[BibT_eX]

[DOI]

Networks, 2016

Preface.

[BibT_eX]

[DOI]

Networks, 2016

An ejection chain approach for the quadratic multiple knapsack problem.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

2015

Exact solutions to generalized vertex covering problems: a comparison of two models.

[BibT_eX]

[DOI]

Optim. Lett., 2015

Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2015

2014

The unconstrained binary quadratic programming problem: a survey.

[BibT_eX]

[DOI]

J. Comb. Optim., 2014

2013

Graph Bisection Modeled as Cardinality Constrained Binary quadratic Task Allocation.

[BibT_eX]

[DOI]

Int. J. Inf. Technol. Decis. Mak., 2013

Solving large scale Max Cut problems via tabu search.

[BibT_eX]

[DOI]

J. Heuristics, 2013

Introduction to special xQx issue.

[BibT_eX]

[DOI]

J. Heuristics, 2013

2012

A computational study on the quadratic knapsack problem with multiple constraints.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2012

2011

Polynomial unconstrained binary optimisation - Part 2.

[BibT_eX]

[DOI]

Jin-Kao Hao

Int. J. Metaheuristics, 2011

Polynomial unconstrained binary optimisation - Part 1.

[BibT_eX]

[DOI]

Jin-Kao Hao

Int. J. Metaheuristics, 2011

2010

A note on optimal solutions to quadratic knapsack problems.

[BibT_eX]

[DOI]

Yaquan Xu

Int. J. Math. Model. Numer. Optimisation, 2010

A two-stage approach to solving large capacitated task allocation problems.

[BibT_eX]

[DOI]

Int. J. Math. Model. Numer. Optimisation, 2010

Theorems Supporting r-flip Search for Pseudo-Boolean Optimization.

[BibT_eX]

[DOI]

Int. J. Appl. Metaheuristic Comput., 2010

2009

Computationally attractive non-linear models for combinatorial optimisation.

[BibT_eX]

[DOI]

Int. J. Math. Oper. Res., 2009

Solving the market split problem via branch-and-cut.

[BibT_eX]

[DOI]

Int. J. Math. Model. Numer. Optimisation, 2009

2008

Simulation Optimization: Applications in Risk Management.

[BibT_eX]

[DOI]

Int. J. Inf. Technol. Decis. Mak., 2008

Simple and fast surrogate constraint heuristics for the maximum independent set problem.

[BibT_eX]

[DOI]

J. Heuristics, 2008

A new approach for modeling and solving set packing problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Clique Partitioning for Clustering: A Comparison with K-Means and Latent Class Analysis.

[BibT_eX]

[DOI]

Commun. Stat. Simul. Comput., 2008

A new modeling and solution approach for the set-partitioning problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

An effective modeling and solution approach for the generalized independent set problem.

[BibT_eX]

[DOI]

Optim. Lett., 2007

Solving the maximum edge weight clique problem via unconstrained quadratic programming.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

New Optimization Models for Data Mining.

[BibT_eX]

[DOI]

Int. J. Inf. Technol. Decis. Mak., 2006

2005

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

[BibT_eX]

[DOI]

Transp. Sci., 2005

Using <i>xQx</i> to model and solve the uncapacitated task allocation problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2005

Clustering of Microarray data via Clique Partitioning.

[BibT_eX]

[DOI]

J. Comb. Optim., 2005

A new modeling and solution approach for the number partitioning problem.

[BibT_eX]

[DOI]

Adv. Decis. Sci., 2005

An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2005

2004

A unified modeling and solution framework for combinatorial optimization problems.

[BibT_eX]

[DOI]

OR Spectr., 2004

An Interactive Clustering Methodology for High Dimensional Data Mining.

[BibT_eX]

[DOI]

Proceedings of the Pacific Asia Conference on Information Systems, 2004

Evaluating a Clique Partitioning Problem Model for Clustering High-Dimensional Data Mining.

[BibT_eX]

[DOI]

Proceedings of the 10th Americas Conference on Information Systems, 2004

2002

An Effective Approach for Solving the Binary Assignment Problem with Side Constraints.

[BibT_eX]

[DOI]

Int. J. Inf. Technol. Decis. Mak., 2002

One-pass heuristics for large-scale unconstrained binary quadratic problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2002

2001

Greedy solutions of selection and ordering problems.

[BibT_eX]

[DOI]

Mohammad M. Amini

Eur. J. Oper. Res., 2001

1982

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

[BibT_eX]

[DOI]

Victor H. Richard

Oper. Res. Lett., 1982

1981

Computing inter-site distances for routing and scheduling problems.

[BibT_eX]

[DOI]

George B. Kleindorfer

Edward T. Reutzel

Oper. Res. Lett., 1981

1979

Some remarks on condensation methods for geometric programs.

[BibT_eX]

[DOI]

Math. Program., 1979

1978

Sensitivity Analysis Procedures for Geometric Programs: Computational Aspects.

[BibT_eX]

[DOI]

S. N. Wong

ACM Trans. Math. Softw., 1978

An implementation of some implicit function theorems with applications to sensitivity analysis.

[BibT_eX]

[DOI]

Math. Program., 1978

Technical Note - An Implementation of Surrogate Constraint Duality.

[BibT_eX]

[DOI]

Oper. Res., 1978

Resource allocation in computer networks by a regional accessibility model.

[BibT_eX]

[DOI]

Y. Seppälä

Comput. Oper. Res., 1978

1977

Computational aspects of cutting-plane algorithms for geometric programming problems.

[BibT_eX]

[DOI]

William H. Elliott

Math. Program., 1977

Technical Note - On Sensitivity Analysis in Geometric Programming.

[BibT_eX]

[DOI]

Oper. Res., 1977

1976

Environmental inspection routes and the constrained travelling system salesman problem.

[BibT_eX]

[DOI]

George B. Kleindorfer

S. N. Wong

Comput. Oper. Res., 1976

1974

An approach to the numerical solutions of geometric programs.

[BibT_eX]

[DOI]

Bruce McCarl

Math. Program., 1974

On "a cofferdam design optimization".

[BibT_eX]

[DOI]