| Publication | Date of Publication | Type |
|---|
A fast local search based memetic algorithm for the parallel row ordering problem
Applied Mathematics and Computation | 2025-04-24 | Paper |
Finding optimal solutions to several gray pattern instances
Optimization Letters | 2022-03-15 | Paper |
Bi-objective optimization of biclustering with binary data
Information Sciences | 2021-11-23 | Paper |
Hybridizing simulated annealing with variable neighborhood search for bipartite graph crossing minimization
Applied Mathematics and Computation | 2019-11-26 | Paper |
Fast simulated annealing for single-row equidistant facility layout
Applied Mathematics and Computation | 2018-08-21 | Paper |
A variable neighborhood search and simulated annealing hybrid for the profile minimization problem
Computers & Operations Research | 2018-07-11 | Paper |
Fast local search for single row facility layout
European Journal of Operational Research | 2016-10-06 | Paper |
Exact algorithms for the solution of the grey pattern quadratic assignment problem
Mathematical Methods of Operations Research | 2015-09-02 | Paper |
An improved exact algorithm for least-squares unidimensional scaling
Journal of Applied Mathematics | 2013-06-14 | Paper |
A branch-and-bound algorithm for the minimum cut linear arrangement problem
Journal of Combinatorial Optimization | 2013-01-03 | Paper |
A branch-and-bound algorithm for the single-row equidistant facility layout problem
OR Spectrum | 2012-05-23 | Paper |
Facet-inducing web and antiweb inequalities for the graph coloring polytope
Discrete Applied Mathematics | 2010-11-25 | Paper |
A new bounding procedure and an improved exact algorithm for the Max-2-SAT problem
Applied Mathematics and Computation | 2009-10-14 | Paper |
On the recursive largest first algorithm for graph colouring
International Journal of Computer Mathematics | 2008-03-27 | Paper |
Iterated tabu search for the maximum diversity problem
Applied Mathematics and Computation | 2007-09-17 | Paper |
| Iterated tabu search for the unconstrained binary quadratic optimization problem | 2006-10-12 | Paper |
A tight lower bound for a special case of quadratic 0-1 programming
Computing | 2006-06-14 | Paper |
Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
Annals of Operations Research | 2005-01-17 | Paper |
| scientific article; zbMATH DE number 1569485 (Why is no real title available?) | 2002-04-28 | Paper |
Generating hard test instances with known optimal solution for the rectilinear quadratic assignment problem
Journal of Global Optimization | 2000-01-05 | Paper |
| scientific article; zbMATH DE number 1203372 (Why is no real title available?) | 1998-09-28 | Paper |
| scientific article; zbMATH DE number 1203238 (Why is no real title available?) | 1998-09-28 | Paper |
| scientific article; zbMATH DE number 1199854 (Why is no real title available?) | 1998-09-16 | Paper |
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem
INFORMS Journal on Computing | 1997-11-25 | Paper |
A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
Computing | 1995-07-03 | Paper |
