On solving the assembly line worker assignment and balancing problem via beam search
C Blum, C Miralles - Computers & Operations Research, 2011 - Elsevier
Certain types of manufacturing processes can be modelled by assembly line balancing
problems. In this work we deal with a specific assembly line balancing problem that is known …
problems. In this work we deal with a specific assembly line balancing problem that is known …
[图书][B] Modular system design and evaluation
MS Levin - 2015 - Springer
The frame approach for representing knowledge (ie, collection of frames are linked together
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …
into frame-system) has been suggested by Marvin Minsky. In this approach, the frame …
Solving longest common subsequence problems via a transformation to the maximum clique problem
Longest common subsequence problems find various applications in bioinformatics, data
compression and text editing, just to name a few. Even though numerous heuristic …
compression and text editing, just to name a few. Even though numerous heuristic …
Finding longest common subsequences: new anytime A∗ search results
Abstract The Longest Common Subsequence (LCS) problem aims at finding a longest string
that is a subsequence of each string from a given set of input strings. This problem has …
that is a subsequence of each string from a given set of input strings. This problem has …
A beam search for the longest common subsequence problem guided by a novel approximate expected length calculation
The longest common subsequence problem (LCS) aims at finding a longest string that
appears as subsequence in each of a given set of input strings. This is a well known NP …
appears as subsequence in each of a given set of input strings. This is a well known NP …
A branch and bound irredundant graph algorithm for large-scale MLCS problems
C Wang, Y Wang, Y Cheung - Pattern Recognition, 2021 - Elsevier
Finding the multiple longest common subsequences (MLCS) among many long sequences
(ie, the large scale MLCS problem) has many important applications, such as gene …
(ie, the large scale MLCS problem) has many important applications, such as gene …
A biased random key genetic algorithm for solving the longest common square subsequence problem
This paper considers the longest common square subsequence (LCSqS) problem, a variant
of the longest common subsequence (LCS) problem in which solutions must be square …
of the longest common subsequence (LCS) problem in which solutions must be square …
An improved algorithm for the longest common subsequence problem
SR Mousavi, F Tabataba - Computers & Operations Research, 2012 - Elsevier
Abstract The Longest Common Subsequence problem seeks a longest subsequence of
every member of a given set of strings. It has applications, among others, in data …
every member of a given set of strings. It has applications, among others, in data …
Graph search and variable neighborhood search for finding constrained longest common subsequences in artificial and real gene sequences
We consider the constrained longest common subsequence problem with an arbitrary set of
input strings as well as an arbitrary set of pattern strings. This problem has applications, for …
input strings as well as an arbitrary set of pattern strings. This problem has applications, for …
Chemical reaction optimization for solving longest common subsequence problem for multiple string
Longest common subsequence (LCS) is a well-known NP-hard optimization problem that
finds out the longest subsequence of each member of a given set of strings. In computational …
finds out the longest subsequence of each member of a given set of strings. In computational …