Zobrazeno 1 - 10
of 30
pro vyhledávání: '"Gintaras Palubeckis"'
Publikováno v:
Mathematics, Vol 10, Iss 13, p 2174 (2022)
The dynamic single row facility layout problem (DSRFLP) is defined as the problem of arranging facilities along a straight line during a multi-period planning horizon with the objective of minimizing the sum of the material handling and rearrangement
Externí odkaz:
https://doaj.org/article/666974aa75e049438af9dc3c41db42cc
Autor:
Gintaras Palubeckis
Publikováno v:
Mathematics, Vol 9, Iss 1, p 5 (2020)
In the bidirectional loop layout problem (BLLP), we are given a set of machines, a set of locations arranged in a loop configuration, and a flow cost matrix. The problem asks to assign machines to locations so as to minimize the sum of the products o
Externí odkaz:
https://doaj.org/article/19e1647be6344667aaadd2c0605da51b
Publikováno v:
The Scientific World Journal, Vol 2014 (2014)
Given an edge-weighted undirected graph with weights specifying dissimilarities between pairs of objects, represented by the vertices of the graph, the clique partitioning problem (CPP) is to partition the vertex set of the graph into mutually disjoi
Externí odkaz:
https://doaj.org/article/a26fea50c1c8488d9f29cf8acc0fb494
Autor:
Gintaras Palubeckis
Publikováno v:
Journal of Applied Mathematics, Vol 2013 (2013)
Given n objects and an symmetric dissimilarity matrix D with zero main diagonal and nonnegative off-diagonal entries, the least-squares unidimensional scaling problem asks to find an arrangement of objects along a straight line such that the pairwise
Externí odkaz:
https://doaj.org/article/338151a538ef4cdbbd4ab23998710876
Autor:
Gintaras Palubeckis
Publikováno v:
Memetic Computing. 14:253-285
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::faf24d971d6d69037613366289212282
https://doi.org/10.1007/s12293-022-00365-w
https://doi.org/10.1007/s12293-022-00365-w
Publikováno v:
Optimization Letters. 16:713-722
In this paper we compare two new binary linear formulations to a standard quadratic binary program for the gray pattern problem and solved all three by the Gurobi solver. One formulation performed significantly better and obtained seven optimal solut
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ba65bb366a1e5d8e666ec6722133719
https://doi.org/10.1007/s11590-021-01732-1
https://doi.org/10.1007/s11590-021-01732-1
Publikováno v:
Memetic Computing. 13:69-90
In this paper, we present a hierarchicity-based (self-similar) hybrid genetic algorithm for the solution of the grey pattern quadratic assignment problem. This is a novel hybrid genetic search-based heuristic algorithm with the original, hierarchical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::378379268896b71552f4b7072b183e62
https://doi.org/10.1007/s12293-020-00321-6
https://doi.org/10.1007/s12293-020-00321-6
Publikováno v:
Applied Mathematics and Computation. 348:84-101
Given a bipartite graph, the problem we address, called the bipartite graph crossing minimization problem (BGCMP), is to find an embedding the parts of the graph along two parallel lines so that the number of edge crossings is minimized. It is assume
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::534690fbb11f0b4ce58139c9a929472d
https://doi.org/10.1016/j.amc.2018.11.051
https://doi.org/10.1016/j.amc.2018.11.051
Autor:
Gintaras Palubeckis
Publikováno v:
Mathematics
Volume 9
Issue 1
Mathematics, Vol 9, Iss 5, p 5 (2021)
Volume 9
Issue 1
Mathematics, Vol 9, Iss 5, p 5 (2021)
In the bidirectional loop layout problem (BLLP), we are given a set of machines, a set of locations arranged in a loop configuration, and a flow cost matrix. The problem asks to assign machines to locations so as to minimize the sum of the products o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::629e40012a676d368330fdc448e80764
https://doi.org/10.3390/math9010005
https://doi.org/10.3390/math9010005
Publikováno v:
Information Sciences
Information Sciences, Elsevier, 2020, 538, pp.444-466. ⟨10.1016/j.ins.2020.05.078⟩
Information Sciences, Elsevier, 2020, 538, pp.444-466. ⟨10.1016/j.ins.2020.05.078⟩
Clustering consists of partitioning data objects into subsets called clusters according to some similarity criteria. This paper addresses a generalization called quasi-clustering that allows overlapping of clusters, and which we link to biclustering.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd0fd0abf605f679347f58c662bf4bc3
https://hal-uphf.archives-ouvertes.fr/hal-03396740
https://hal-uphf.archives-ouvertes.fr/hal-03396740