Palubeckis Gintaras

Gintaras Palubeckis

Information about the author Gintaras Palubeckis will soon be added to the site.
Found 7 papers in total
Maximally diverse grouping: an iterated tabu search approach
Maximally diverse grouping: an iterated tabu search approach
2015
The maximally diverse grouping problem (MDGP) consists of finding a partition of a set...
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
A branch‐and‐bound algorithm for the minimum cut linear arrangement problem
2012
Given an edge‐weighted graph G of order n , the minimum cut linear arrangement...
A branch‐and‐bound algorithm for the single‐row equidistant facility layout problem
A branch‐and‐bound algorithm for the single‐row equidistant facility layout problem
2012
In this paper, we deal with the single‐row equidistant facility layout problem...
Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
2004
This paper describes and experimentally compares five different multistart tabu search...
An algorithm for construction of test cases for the quadratic assignment problem
An algorithm for construction of test cases for the quadratic assignment problem
2000
In this paper we present an algorithm for generating quadratic assignment problem...
A branch-and-bound approach using polyhedral resuls for a clustering problem
A branch-and-bound approach using polyhedral resuls for a clustering problem
1997
This article describes a variation of the branch and bound method for solving a...
A branch-and-bound approach using polyhedral results for a clustering problem
A branch-and-bound approach using polyhedral results for a clustering problem
1997
This article describes a variation of the branch and bound method for solving a...
Papers per page: