Kochenberger Gary A.

Gary A. Kochenberger

Information about the author Gary A. Kochenberger will soon be added to the site.
Found 5 papers in total
An unconstrained quadratic binary programming approach to the vertex coloring problem
An unconstrained quadratic binary programming approach to the vertex coloring problem
2005
The vertex coloring problem has been the subject of extensive research for many years....
A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
A note on a simple dynamic programming approach to the single-sink, fixed-charge transportation problem
2005
The single-sink, fixed-charge transportation problem has a variety of applications,...
Greedy solutions of selection and ordering problems
Greedy solutions of selection and ordering problems
2001
The greedy method is a well-known technique for approaching problems involving the...
Adaptive memory tabu search for binary quadratic programs
Adaptive memory tabu search for binary quadratic programs
1998
Recent studies have demonstrated the effectiveness of applying adaptive memory tabu...
The computer runs the Bolder Boulder: A simulation of a major running race
The computer runs the Bolder Boulder: A simulation of a major running race
1989
The annual Bolder Boulder, one of America’s top 10k races, attracts world-class...
Papers per page: