The maximum fuzzy weighted matching models and hybrid genetic algorithm

DOI10.1016/J.AMC.2006.01.051MaRDI QIDQ945410zbMATH OpenOpenAlexFDO

Authors Linzhong Liu, Li-Xing Yang, Yinzhen Li

Publication date 12 September 2008

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2006.01.051

zbMATH Keywords

matchingcredibility measurefuzzy setgenetic algorithmexpected maximum fuzzy weighted matchingpattern recognizing

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Finding a complete matching with the maximum product on weighted bipartite graphs
• scientific article; zbMATH DE number 795216
• Maximum weight edge-constrained matchings
• A genetic-based framework for solving (multi-criteria) weighted matching problems.
• Research on matrix algorithm of the greatest matching of the simple graph

Cites work

• scientific article; zbMATH DE number 193123 (Why is no real title available?)
• A fuzzy max-flow min-cut theorem.
• A linear time algorithm for maximum matchings in convex, bipartite graphs
• A note on chance constrained programming with fuzzy coefficients
• A note on the weighted matching with penalty problem
• A shortest path problem on a network with fuzzy arc lengths
• Chance constrained programming with fuzzy parameters
• Chance-constrained programming
• Efficient algorithms for finding maximum matching in graphs
• Fuzzy optimal flow on imprecise structures
• Fuzzy sets
• Fuzzy shortest path problems incorporating interactivity among paths.
• Generalized path-finding algorithms on semirings and the fuzzy shortest path problem.
• Graph theory
• Minimax chance constrained programming models for fuzzy decision systems
• On maximum induced matchings in bipartite graphs
• On the sets of perfect matchings for two bipartite graphs
• Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
• Small maximal matchings in random graphs.
• The perfectly matchable subgraph polytope of an arbitrary graph
• Theory and practice of uncertain programming
• Toward fuzzy optimization without mathematical ambiguity
• Uncertainty theory. An introduction to its axiomatic foundations.

Cited in

(5)

• Uncertain measure and its application in minimum weighted maximal matching problem
• A fuzzy model for NMT word alignment using quasi-perfect matching
• A genetic-based framework for solving (multi-criteria) weighted matching problems.
• A survey of credibility theory
• On the matching number of an uncertain graph

This page was built for publication: The maximum fuzzy weighted matching models and hybrid genetic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945410)