Optimal and heuristic solutions for placing multiple finite-size rectangular facilities in an existing layout
In a companion paper (Date, K., and R. Nagi.[(2023) Optimal Placement of Multiple Finite-
size Rectangular Facilities in an Existing Layout. International Journal of Production …
size Rectangular Facilities in an Existing Layout. International Journal of Production …
A hybrid genetic-hierarchical algorithm for the quadratic assignment problem
A Misevičius, D Verenė - Entropy, 2021 - mdpi.com
In this paper, we present a hybrid genetic-hierarchical algorithm for the solution of the
quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is …
quadratic assignment problem. The main distinguishing aspect of the proposed algorithm is …
A restricted dual Peaceman-Rachford splitting method for a strengthened DNN relaxation for QAP
Splitting methods in optimization arise when one can divide an optimization problem into
two or more simpler subproblems. They have proven particularly successful for relaxations …
two or more simpler subproblems. They have proven particularly successful for relaxations …
Exactly solving hard permutation flowshop scheduling problems on peta-scale gpu-accelerated supercomputers
J Gmys - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
Makespan minimization in permutation flow-shop scheduling is a well-known hard
combinatorial optimization problem. Among the 120 standard benchmark instances …
combinatorial optimization problem. Among the 120 standard benchmark instances …
[HTML][HTML] HyLAC: Hybrid linear assignment solver in CUDA
Abstract The Linear Assignment Problem (LAP) is a fundamental combinatorial optimization
problem with a wide range of applications. Over the years, significant progress has been …
problem with a wide range of applications. Over the years, significant progress has been …
[HTML][HTML] An Improved Hybrid Genetic-Hierarchical Algorithm for the Quadratic Assignment Problem
A Misevičius, A Andrejevas, A Ostreika, D Verenė… - Mathematics, 2024 - mdpi.com
In this paper, an improved hybrid genetic-hierarchical algorithm for the solution of the
quadratic assignment problem (QAP) is presented. The algorithm is based on the genetic …
quadratic assignment problem (QAP) is presented. The algorithm is based on the genetic …
Solving large permutation flow-shop scheduling problems on GPU-accelerated supercomputers
J Gmys - arxiv preprint arxiv:2012.09511, 2020 - arxiv.org
Makespan minimization in permutation flow-shop scheduling is a well-known hard
combinatorial optimization problem. Among the 120 standard benchmark instances …
combinatorial optimization problem. Among the 120 standard benchmark instances …
A restricted dual Peaceman-Rachford splitting method for QAP
We revisit and strengthen splitting methods for solving doubly nonnegative, DNN,
relaxations of the quadratic assignment problem, QAP. We use a modified restricted …
relaxations of the quadratic assignment problem, QAP. We use a modified restricted …
A robust real-time computing-based environment sensing system for intelligent vehicle
Q **e, Q Long, L Zhang, Z Sun - arxiv preprint arxiv:2001.09678, 2020 - arxiv.org
For intelligent vehicles, sensing the 3D environment is the first but crucial step. In this paper,
we build a real-time advanced driver assistance system based on a low-power mobile …
we build a real-time advanced driver assistance system based on a low-power mobile …
A Dual-Ascent Algorithm for the Multi-dimensional Assignment Problem: Application to Multi-Target Tracking
Recently we proposed a new Mixed-Integer Linear Programming formulation for the Multi-
Target Tracking (MTT) problem and used a standard optimization solver to demonstrate its …
Target Tracking (MTT) problem and used a standard optimization solver to demonstrate its …