Gintaras Palubeckis

Publication Activity (10 Years)

Years Active: 1995-2022
Publications (10 Years): 13

Top Topics

Quadratic Assignment Problem

Genetic Algorithm

Simulated Annealing

Top Venues

Memetic Comput.

Appl. Math. Comput.

Publications

Zvi Drezner, Pawel Jan Kalczynski, Alfonsas Misevicius, Gintaras Palubeckis
Finding optimal solutions to several gray pattern instances. Optim. Lett. 16 (2) (2022)
Gintaras Palubeckis
Metaheuristic approaches for ratio cut and normalized cut graph partitioning. Memetic Comput. 14 (3) (2022)
Alfonsas Misevicius, Gintaras Palubeckis, Zvi Drezner
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem. Memetic Comput. 13 (1) (2021)
Fred W. Glover, Saïd Hanafi, Gintaras Palubeckis
Bi-objective Optimization of Biclustering with Binary Data. CoRR (2020)
Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover
Bi-objective optimization of biclustering with binary data. Inf. Sci. 538 (2020)
Gintaras Palubeckis, Arunas Tomkevicius, Armantas Ostreika
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization. Appl. Math. Comput. 348 (2019)
Zahnupriya Kalita, Dilip Datta, Gintaras Palubeckis
Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique. Soft Comput. 23 (3) (2019)
Gintaras Palubeckis
Single row facility layout using multi-start simulated annealing. Comput. Ind. Eng. 103 (2017)
Gintaras Palubeckis
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem. Comput. Oper. Res. 87 (2017)
Gintaras Palubeckis
Fast local search for single row facility layout. Eur. J. Oper. Res. 246 (3) (2015)
Gintaras Palubeckis
Fast simulated annealing for single-row equidistant facility layout. Appl. Math. Comput. 263 (2015)
Gintaras Palubeckis, Armantas Ostreika, Dalius Rubliauskas
Maximally diverse grouping: an iterated tabu search approach. J. Oper. Res. Soc. 66 (4) (2015)
Zvi Drezner, Alfonsas Misevicius, Gintaras Palubeckis
Exact algorithms for the solution of the grey pattern quadratic assignment problem. Math. Methods Oper. Res. 82 (1) (2015)
Gintaras Palubeckis
An Improved Exact Algorithm for Least-Squares Unidimensional Scaling. J. Appl. Math. 2013 (2013)
Gintaras Palubeckis
A branch-and-bound algorithm for the single-row equidistant facility layout problem. OR Spectr. 34 (1) (2012)
Gintaras Palubeckis, Dalius Rubliauskas
A branch-and-bound algorithm for the minimum cut linear arrangement problem. J. Comb. Optim. 24 (4) (2012)
Gintaras Palubeckis, Eimutis Karciauskas, Aleksas Riskus
Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem. Inf. Technol. Control. 40 (4) (2011)
Gintaras Palubeckis
Facet-inducing web and antiweb inequalities for the graph coloring polytope. Discret. Appl. Math. 158 (18) (2010)
Gintaras Palubeckis
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem. Appl. Math. Comput. 215 (3) (2009)
Gintaras Palubeckis
On the recursive largest first algorithm for graph colouring. Int. J. Comput. Math. 85 (2) (2008)
Gintaras Palubeckis
Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189 (1) (2007)
Gintaras Palubeckis
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem. Informatica 17 (2) (2006)
Gintaras Palubeckis
A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming. Computing 77 (2) (2006)
Gintaras Palubeckis
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem. Ann. Oper. Res. 131 (1-4) (2004)
Gintaras Palubeckis
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem. Informatica 11 (3) (2000)
Gintaras Palubeckis
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem. J. Glob. Optim. 15 (2) (1999)
Gintaras Palubeckis
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem. INFORMS J. Comput. 9 (1) (1997)
Gintaras Palubeckis
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming. Computing 54 (4) (1995)