Gintaras Palubeckis

Orcid: 0000-0002-4991-1505

According to our database1, Gintaras Palubeckis authored at least 28 papers between 1995 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
A fast local search based memetic algorithm for the parallel row ordering problem.
Appl. Math. Comput., 2025

2022
Finding optimal solutions to several gray pattern instances.
Optim. Lett., 2022

Metaheuristic approaches for ratio cut and normalized cut graph partitioning.
Memetic Comput., 2022

2021
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem.
Memetic Comput., 2021

2020
Bi-objective optimization of biclustering with binary data.
Inf. Sci., 2020

2019
Bi-objective corridor allocation problem using a permutation-based genetic algorithm hybridized with a local search technique.
Soft Comput., 2019

Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization.
Appl. Math. Comput., 2019

2017
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem.
Comput. Oper. Res., 2017

Single row facility layout using multi-start simulated annealing.
Comput. Ind. Eng., 2017

2015
Exact algorithms for the solution of the grey pattern quadratic assignment problem.
Math. Methods Oper. Res., 2015

Maximally diverse grouping: an iterated tabu search approach.
J. Oper. Res. Soc., 2015

Fast local search for single row facility layout.
Eur. J. Oper. Res., 2015

Fast simulated annealing for single-row equidistant facility layout.
Appl. Math. Comput., 2015

2013
An Improved Exact Algorithm for Least-Squares Unidimensional Scaling.
J. Appl. Math., 2013

2012
A branch-and-bound algorithm for the single-row equidistant facility layout problem.
OR Spectr., 2012

A branch-and-bound algorithm for the minimum cut linear arrangement problem.
J. Comb. Optim., 2012

2011
Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem.
Inf. Technol. Control., 2011

2010
Facet-inducing web and antiweb inequalities for the graph coloring polytope.
Discret. Appl. Math., 2010

2009
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem.
Appl. Math. Comput., 2009

2008
On the recursive largest first algorithm for graph colouring.
Int. J. Comput. Math., 2008

2007
Iterated tabu search for the maximum diversity problem.
Appl. Math. Comput., 2007

2006
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem.
Informatica, 2006

A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming.
Computing, 2006

2004
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem.
Ann. Oper. Res., 2004

2000
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem.
Informatica, 2000

1999
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem.
J. Glob. Optim., 1999

1997
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem.
INFORMS J. Comput., 1997

1995
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming.
Computing, 1995


  Loading...