Gintaras Palubeckis

Available identifiers

zbMath Open palubeckis.gintarasDBLP24/4834WikidataQ87692483 ScholiaQ87692483MaRDI QIDQ319871

List of research outcomes

Publication	Date of Publication	Type
Finding optimal solutions to several gray pattern instances	2022-03-15	Paper
Bi-objective optimization of biclustering with binary data	2021-11-23	Paper
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization	2019-11-26	Paper
Fast simulated annealing for single-row equidistant facility layout	2018-08-21	Paper
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem	2018-07-11	Paper
Fast local search for single row facility layout	2016-10-06	Paper
Exact algorithms for the solution of the grey pattern quadratic assignment problem	2015-09-02	Paper
An improved exact algorithm for least-squares unidimensional scaling	2013-06-14	Paper
A branch-and-bound algorithm for the minimum cut linear arrangement problem	2013-01-03	Paper
A branch-and-bound algorithm for the single-row equidistant facility layout problem	2012-05-23	Paper
Facet-inducing web and antiweb inequalities for the graph coloring polytope	2010-11-25	Paper
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem	2009-10-14	Paper
On the recursive largest first algorithm for graph colouring	2008-03-27	Paper
Iterated tabu search for the maximum diversity problem	2007-09-17	Paper
https://portal.mardi4nfdi.de/entity/Q5491984	2006-10-12	Paper
A tight lower bound for a special case of quadratic 0-1 programming	2006-06-14	Paper
Multistart tabu search strategies for the unconstrained binary quadratic optimization problem	2005-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4762950	2002-04-28	Paper
Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem	2000-01-05	Paper
https://portal.mardi4nfdi.de/entity/Q4209456	1998-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q4209596	1998-09-28	Paper
https://portal.mardi4nfdi.de/entity/Q4211321	1998-09-16	Paper
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem	1997-11-25	Paper
A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming	1995-07-03	Paper

Research outcomes over time

This page was built for person: Gintaras Palubeckis