158 citations · 391 across the 15 of their papers we have counts for
12 papers · 1 filter
Acceleration for Timing-Aware Gate-Level Logic Simulation with One-Pass GPU Parallelism
Weijie Fang, Yanggeng Fu, Jiaquan Gao +3
Witnessing the advancing scale and complexity of chip design and benefiting from high-performance computation technologies, the simulation of Very Large Scale Integration (VLSI) Ci…
Solving Routing Problems via Important Cuts
Bin Sheng, Gregory Gutin
We introduce a novel approach of using important cuts which allowed us to design significantly faster fixed-parameter tractable (FPT) algorithms for the following routing problems:…
Valued Authorization Policy Existence Problem: Theory and Experiments
Jason Crampton, Eduard Eiben, Gregory Gutin +2
Recent work has shown that many problems of satisfiability and resiliency in workflows may be viewed as special cases of the authorization policy existence problem (APEP), which re…
Pattern Backtracking Algorithm for the Workflow Satisfiability Problem
Daniel Karapetyan, Andrei Gagarin, Gregory Gutin
The workflow satisfiability problem (WSP) asks whether there exists an assignment of authorised users to the steps in a workflow specification, subject to certain constraints on th…
Efficient Local Search Algorithms for Known and New Neighborhoods for the Generalized Traveling Salesman Problem
Daniel Karapetyan, Gregory Gutin
The Generalized Traveling Salesman Problem (GTSP) is a well-known combinatorial optimization problem with a host of applications. It is an extension of the Traveling Salesman Probl…
A New Approach to Population Sizing for Memetic Algorithms: A Case Study for the Multidimensional Assignment Problem
Daniel Karapetyan, Gregory Gutin
Memetic Algorithms are known to be a powerful technique in solving hard optimization problems. To design a memetic algorithm one needs to make a host of decisions; selecting a popu…
Lin-Kernighan Heuristic Adaptations for the Generalized Traveling Salesman Problem
Daniel Karapetyan, Gregory Gutin
The Lin-Kernighan heuristic is known to be one of the most successful heuristics for the Traveling Salesman Problem (TSP). It has also proven its efficiency in application to some…
Empirical evaluation of construction heuristics for the multidimensional assignment problem
Daniel Karapetyan, Gregory Gutin, Boris Goldengorin
The multidimensional assignment problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3…
A Memetic Algorithm for the Multidimensional Assignment Problem
Gregory Gutin, Daniel Karapetyan
The Multidimensional Assignment Problem (MAP or s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3-AP, though…
Local Search Heuristics For The Multidimensional Assignment Problem
Gregory Gutin, Daniel Karapetyan
The Multidimensional Assignment Problem (MAP) (abbreviated s-AP in the case of s dimensions) is an extension of the well-known assignment problem. The most studied case of MAP is 3…
Generalized Traveling Salesman Problem Reduction Algorithms
Gregory Gutin, Daniel Karapetyan
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are r…
A Memetic Algorithm for the Generalized Traveling Salesman Problem
Gregory Gutin, Daniel Karapetyan
The generalized traveling salesman problem (GTSP) is an extension of the well-known traveling salesman problem. In GTSP, we are given a partition of cities into groups and we are r…