The following pages link to Gintaras Palubeckis (Q319871):
Displaying 25 items.
- Fast local search for single row facility layout (Q319872) (← links)
- A branch-and-bound algorithm for the single-row equidistant facility layout problem (Q421088) (← links)
- Exact algorithms for the solution of the grey pattern quadratic assignment problem (Q494699) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem (Q702730) (← links)
- A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem (Q734870) (← links)
- A variable neighborhood search and simulated annealing hybrid for the profile minimization problem (Q1652400) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- (Q1819195) (redirect page) (← links)
- Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem (Q1819196) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization (Q2008804) (← links)
- Finding optimal solutions to several gray pattern instances (Q2115324) (← links)
- An improved exact algorithm for least-squares unidimensional scaling (Q2375707) (← links)
- Iterated tabu search for the maximum diversity problem (Q2381330) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- Bi-objective optimization of biclustering with binary data (Q2666768) (← links)
- (Q4209456) (← links)
- (Q4209596) (← links)
- (Q4211321) (← links)
- A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem (Q4367040) (← links)
- (Q4762950) (← links)
- On the recursive largest first algorithm for graph colouring (Q5451459) (← links)
- (Q5491984) (← links)
