Kochenberger Gary

Gary Kochenberger

Information about the author Gary Kochenberger will soon be added to the site.
Found 10 papers in total
Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
Probabilistic multistart with path relinking for solving the unconstrained binary quadratic problem
2016
The unconstrained binary quadratic problem (UBQP) has been shown to be an...
A computational study on the quadratic knapsack problem with multiple constraints
A computational study on the quadratic knapsack problem with multiple constraints
2012
The quadratic knapsack problem (QKP) has been the subject of considerable research in...
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
A note on xQx as a modelling and solution framework for the Linear Ordering Problem
2009
This paper expands the list of 0-1 problems that can be effectively modelled and...
Simple and fast surrogate constraint heuristics for the maximum independent set problem
Simple and fast surrogate constraint heuristics for the maximum independent set problem
2008
In a recent paper Glover (2003) discussed a variety of surrogate...
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008
The set-partitioning problem (SPP) is widely known for both its application potential...
A new modeling and solution approach for the set-partitioning problem
A new modeling and solution approach for the set-partitioning problem
2008
The set-partitioning problem (SPP) is widely known for both its application potential...
Solving group technology problems via clique partitioning
Solving group technology problems via clique partitioning
2006
This paper presents a new clique partitioning (CP) model for the Group Technology (GT)...
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
Using the unconstrained quadratic program to model and solve Max 2-SAT problems
2005
Satisfiability (SAT) and Max-SAT problems have been the object of considerable...
Using xQx to model and solve the uncapacitated task allocation problem
Using xQx to model and solve the uncapacitated task allocation problem
2005
This paper illustrates how large instances of the unconstrained task allocation...
One-pass heuristics for large-scale unconstrained binary quadratic problems
One-pass heuristics for large-scale unconstrained binary quadratic problems
2002
Many significant advances have been made in recent years for solving unconstrained...
Papers per page: