| 2008 |
|---|
| 8 | EE | Gintaras Palubeckis:
On the recursive largest first algorithm for graph colouring.
Int. J. Comput. Math. 85(2): 191-200 (2008) |
| 2007 |
|---|
| 7 | EE | Gintaras Palubeckis:
Iterated tabu search for the maximum diversity problem.
Applied Mathematics and Computation 189(1): 371-383 (2007) |
| 2006 |
|---|
| 6 | EE | Gintaras Palubeckis:
A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming.
Computing 77(2): 131-145 (2006) |
| 5 | EE | Gintaras Palubeckis:
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem.
Informatica, Lith. Acad. Sci. 17(2): 279-296 (2006) |
| 2004 |
|---|
| 4 | EE | Gintaras Palubeckis:
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem.
Annals OR 131(1-4): 259-282 (2004) |
| 2000 |
|---|
| 3 | EE | Gintaras Palubeckis:
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem.
Informatica, Lith. Acad. Sci. 11(3): 281-296 (2000) |
| 1997 |
|---|
| 2 | EE | Gintaras Palubeckis:
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem.
INFORMS Journal on Computing 9(1): 30-42 (1997) |
| 1995 |
|---|
| 1 | EE | Gintaras Palubeckis:
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming.
Computing 54(4): 283-302 (1995) |
