Gintaras Palubeckis

32 papers Journal 30Unranked 2
YearRankTypeTitle / Venue / Authors
2025 — conf
A Descent-Ascent Principle Based Heuristic Algorithm for the Quadratic Assignment Problem.
ICIST
Alfonsas Misevicius, Gintaras Palubeckis, Dovile Verene, Gintare Zekiene
2025 J jnl
A fast local search based memetic algorithm for the parallel row ordering problem.
Appl. Math. Comput.
Gintaras Palubeckis
2025 J jnl
Automatic motor and visuospatial cognition screening with ensemble learning: A computerised clock drawing test approach.
Comput. Biol. Medicine
Andrius Lauraitis, Armantas Ostreika, Gintaras Palubeckis, Liudas Motiejunas
2025 — conf
The Practices of Applying Artificial Intelligence in Engineering Education.
ICIST
Daina Gudoniene, Donatas Iliska, Gintaras Palubeckis, Alfonsas Misevicius, Donata Sermuksne, Pijus Balcius, Justyna Janik, Bozena Majerek, Yolanda Escudero Martín
2022 J jnl
Finding optimal solutions to several gray pattern instances.
Optim. Lett.
Zvi Drezner, Pawel Jan Kalczynski, Alfonsas Misevicius, Gintaras Palubeckis
2022 J jnl
Metaheuristic approaches for ratio cut and normalized cut graph partitioning.
Memetic Comput.
Gintaras Palubeckis
2021 J jnl
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem.
Memetic Comput.
Alfonsas Misevicius, Gintaras Palubeckis, Zvi Drezner
2020 J jnl
Bi-objective Optimization of Biclustering with Binary Data.
CoRR
Fred W. Glover, Saïd Hanafi, Gintaras Palubeckis
2020 J jnl
Bi-objective optimization of biclustering with binary data.
Inf. Sci.
Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover
2019 J jnl
Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique.
Soft Comput.
Zahnupriya Kalita, Dilip Datta, Gintaras Palubeckis
2019 J jnl
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization.
Appl. Math. Comput.
Gintaras Palubeckis, Arunas Tomkevicius, Armantas Ostreika
2017 J jnl
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem.
Comput. Oper. Res.
Gintaras Palubeckis
2017 J jnl
Single row facility layout using multi-start simulated annealing.
Comput. Ind. Eng.
Gintaras Palubeckis
2015 J jnl
Exact algorithms for the solution of the grey pattern quadratic assignment problem.
Math. Methods Oper. Res.
Zvi Drezner, Alfonsas Misevicius, Gintaras Palubeckis
2015 J jnl
Fast local search for single row facility layout.
Eur. J. Oper. Res.
Gintaras Palubeckis
2015 J jnl
Fast simulated annealing for single-row equidistant facility layout.
Appl. Math. Comput.
Gintaras Palubeckis
2015 J jnl
Maximally diverse grouping: an iterated tabu search approach.
J. Oper. Res. Soc.
Gintaras Palubeckis, Armantas Ostreika, Dalius Rubliauskas
2013 J jnl
An Improved Exact Algorithm for Least-Squares Unidimensional Scaling.
J. Appl. Math.
Gintaras Palubeckis
2012 J jnl
A branch-and-bound algorithm for the minimum cut linear arrangement problem.
J. Comb. Optim.
Gintaras Palubeckis, Dalius Rubliauskas
2012 J jnl
A branch-and-bound algorithm for the single-row equidistant facility layout problem.
OR Spectr.
Gintaras Palubeckis
2011 J jnl
Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem.
Inf. Technol. Control.
Gintaras Palubeckis, Eimutis Karciauskas, Aleksas Riskus
2010 J jnl
Facet-inducing web and antiweb inequalities for the graph coloring polytope.
Discret. Appl. Math.
Gintaras Palubeckis
2009 J jnl
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem.
Appl. Math. Comput.
Gintaras Palubeckis
2008 J jnl
On the recursive largest first algorithm for graph colouring.
Int. J. Comput. Math.
Gintaras Palubeckis
2007 J jnl
Iterated tabu search for the maximum diversity problem.
Appl. Math. Comput.
Gintaras Palubeckis
2006 J jnl
A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming.
Computing
Gintaras Palubeckis
2006 J jnl
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem.
Informatica
Gintaras Palubeckis
2004 J jnl
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem.
Ann. Oper. Res.
Gintaras Palubeckis
2000 J jnl
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem.
Informatica
Gintaras Palubeckis
1999 J jnl
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem.
J. Glob. Optim.
Gintaras Palubeckis
1997 J jnl
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem.
INFORMS J. Comput.
Gintaras Palubeckis
1995 J jnl
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming.
Computing
Gintaras Palubeckis