Bipartite Complete Matching Vertex Interdiction Problem: Application to Robust Nurse Assignment

2014 ◽  
Author(s):  
Pierre Laroche ◽  
Franc Marchetti ◽  
Sebastien Martin ◽  
Zsuzsanna Roka
Keyword(s):  
Nurse Assignment ◽  
Complete Matching

Complete Pattern Matching for DNA Computing

2006 ◽  
Vol 05 (04) ◽  
pp. 337-343
Author(s):  
Nadia Nedjah ◽  
Luiza De Macedo Mourelle
Keyword(s):  
Information Retrieval ◽  
Logic Programming ◽  
Pattern Matching ◽  
Theorem Proving ◽  
Dna Computing ◽  
Term Rewriting ◽  
Matching Method ◽  
Subject Term ◽  
Matching Technique ◽  
Complete Matching

Pattern matching is essential in many applications such as information retrieval, logic programming, theorem-proving, term rewriting and DNA-computing. It usually breaks down into two categories: root and complete pattern matching. Root matching determines whether a subject term is an instance of a pattern in a pattern set while complete matching determines whether a subject term contains a sub-term that is an instance of a pattern in a pattern set. For the sake of efficiency, root pattern matching need to be deterministic and lazy. Furthermore, complete pattern matching also needs to be parallel. Unlike root pattern matching, complete matching received little interest from the researchers of the field. In this paper, we present a novel deterministic multi-threaded complete matching method. This method subsumes a deterministic lazy root matching technique that was developped by the authors in an earlier work. We evaluate the performance of proposed method using theorem-proving and DNA-computing applications.

Study on Three-Level Matching Model of Product Configuration Oriented to Mass Customization

2009 ◽  
Vol 407-408 ◽  
pp. 257-263
Author(s):  
Jiang Hua Ge ◽  
Yong Lin Xu ◽  
Yong Tao Huang ◽  
Guo An Gao
Keyword(s):  
Mathematical Model ◽  
Mass Customization ◽  
Product Structure ◽  
Product Configuration ◽  
Retrieval Algorithm ◽  
Configuration Design ◽  
Similarity Matching ◽  
Matching Model ◽  
Correlation Matching ◽  
Complete Matching

This paper proposed configuration three-level matching model based on modular product structure in order to solve the product configuration design problem in mass customization (MC). According to the product structure and the features of configuration design, the model divided the configuration course into three parts as first-level complete matching, second-level similarity matching and third-level correlation matching. Firstly obtained standard module that meets clients’ demands by retrieval algorithm of first-level complete matching and similar module of the customized by mathematical model of second-level similarity matching. Then based on them, analyzed the correlation matrix among modules and associated attributes of modules interface, and established the mathematical model of third-level correlation matching and realized the optimum combination of modules. Finally, verified the model by examples. The results indicate that this model could effectively solve the low-efficiency problem of deformation module recombination design in traditional product configuration so to rapidly respond to clients’ customization demands.

scholarly journals Finding a complete matching with the maximum product on weighted bipartite graphs

1993 ◽  
Vol 25 (5) ◽  
pp. 65-71
Author(s):  
Frank S.C. Tseng ◽  
Wei-Pang Yang ◽  
Arbee L.P. Chen
Keyword(s):  
Bipartite Graphs ◽  
Complete Matching
Sign in / Sign up

Export Citation Format

Share Document