Gintaras Palubeckis A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming. [Citation Graph (0, 0)][DBLP] Computing, 1995, v:54, n:4, pp:283-302 [Journal]

Gintaras Palubeckis An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem. [Citation Graph (0, 0)][DBLP] Informatica, Lith. Acad. Sci., 2000, v:11, n:3, pp:281-296 [Journal]

Gintaras Palubeckis A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem. [Citation Graph (0, 0)][DBLP] INFORMS Journal on Computing, 1997, v:9, n:1, pp:30-42 [Journal]

Gintaras Palubeckis Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem. [Citation Graph (0, 0)][DBLP] Informatica, Lith. Acad. Sci., 2006, v:17, n:2, pp:279-296 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1

System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2

The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP