default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGintaras Palubeckis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j28]Gintaras Palubeckis
:
A fast local search based memetic algorithm for the parallel row ordering problem. Appl. Math. Comput. 486: 129040 (2025)- 2022
- [j27]Gintaras Palubeckis:
Metaheuristic approaches for ratio cut and normalized cut graph partitioning. Memetic Comput. 14(3): 253-285 (2022) - [j26]Zvi Drezner, Pawel Jan Kalczynski, Alfonsas Misevicius, Gintaras Palubeckis:
Finding optimal solutions to several gray pattern instances. Optim. Lett. 16(2): 713-722 (2022) - 2021
- [j25]Alfonsas Misevicius, Gintaras Palubeckis, Zvi Drezner:
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem. Memetic Comput. 13(1): 69-90 (2021) - 2020
- [j24]Saïd Hanafi, Gintaras Palubeckis, Fred W. Glover:
Bi-objective optimization of biclustering with binary data. Inf. Sci. 538: 444-466 (2020) - 2019
- [j23]Gintaras Palubeckis, Arunas Tomkevicius, Armantas Ostreika:
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization. Appl. Math. Comput. 348: 84-101 (2019) - [j22]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): 961-986 (2019) - 2017
- [j21]Gintaras Palubeckis:
Single row facility layout using multi-start simulated annealing. Comput. Ind. Eng. 103: 1-16 (2017) - [j20]Gintaras Palubeckis:
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem. Comput. Oper. Res. 87: 83-97 (2017) - 2015
- [j19]Gintaras Palubeckis:
Fast simulated annealing for single-row equidistant facility layout. Appl. Math. Comput. 263: 287-301 (2015) - [j18]Gintaras Palubeckis:
Fast local search for single row facility layout. Eur. J. Oper. Res. 246(3): 800-814 (2015) - [j17]Gintaras Palubeckis, Armantas Ostreika, Dalius Rubliauskas:
Maximally diverse grouping: an iterated tabu search approach. J. Oper. Res. Soc. 66(4): 579-592 (2015) - [j16]Zvi Drezner, Alfonsas Misevicius, Gintaras Palubeckis:
Exact algorithms for the solution of the grey pattern quadratic assignment problem. Math. Methods Oper. Res. 82(1): 85-105 (2015) - 2013
- [j15]Gintaras Palubeckis:
An Improved Exact Algorithm for Least-Squares Unidimensional Scaling. J. Appl. Math. 2013: 890589:1-890589:15 (2013) - 2012
- [j14]Gintaras Palubeckis, Dalius Rubliauskas:
A branch-and-bound algorithm for the minimum cut linear arrangement problem. J. Comb. Optim. 24(4): 540-563 (2012) - [j13]Gintaras Palubeckis:
A branch-and-bound algorithm for the single-row equidistant facility layout problem. OR Spectr. 34(1): 1-21 (2012) - 2011
- [j12]Gintaras Palubeckis, Eimutis Karciauskas, Aleksas Riskus:
Comparative Performance of Three Metaheuristic Approaches for the maximally Diverse Grouping Problem. Inf. Technol. Control. 40(4): 277-285 (2011) - 2010
- [j11]Gintaras Palubeckis:
Facet-inducing web and antiweb inequalities for the graph coloring polytope. Discret. Appl. Math. 158(18): 2075-2080 (2010) - 2009
- [j10]Gintaras Palubeckis:
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem. Appl. Math. Comput. 215(3): 1106-1117 (2009) - 2008
- [j9]Gintaras Palubeckis:
On the recursive largest first algorithm for graph colouring. Int. J. Comput. Math. 85(2): 191-200 (2008) - 2007
- [j8]Gintaras Palubeckis:
Iterated tabu search for the maximum diversity problem. Appl. Math. Comput. 189(1): 371-383 (2007) - 2006
- [j7]Gintaras Palubeckis:
A Tight Lower Bound for a Special Case of Quadratic 0-1 Programming. Computing 77(2): 131-145 (2006) - [j6]Gintaras Palubeckis:
Iterated Tabu Search for the Unconstrained Binary Quadratic Optimization Problem. Informatica 17(2): 279-296 (2006) - 2004
- [j5]Gintaras Palubeckis:
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem. Ann. Oper. Res. 131(1-4): 259-282 (2004) - 2000
- [j4]Gintaras Palubeckis:
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem. Informatica 11(3): 281-296 (2000) - 1999
- [j3]Gintaras Palubeckis:
Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem. J. Glob. Optim. 15(2): 127-156 (1999) - 1997
- [j2]Gintaras Palubeckis:
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem. INFORMS J. Comput. 9(1): 30-42 (1997) - 1995
- [j1]Gintaras Palubeckis:
A Heuristic-Based Branch and Bound Algorithm for Unconstrained Quadratic Zero One Programming. Computing 54(4): 283-302 (1995)
Informal and Other Publications
- 2020
- [i1]Fred W. Glover, Saïd Hanafi, Gintaras Palubeckis:
Bi-objective Optimization of Biclustering with Binary Data. CoRR abs/2002.04711 (2020)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
