Výsledky vyhledávání - Matching Problem and Algorithm

Algorithms for graph theory matching problems based on computer science.

Autoři: Jin, Jingjing

Zdroj: International Journal of Modern Physics C: Computational Physics & Physical Computation; Aug2025, Vol. 36 Issue 8, p1-19, 19p

Témata: PARTICLE swarm optimization, GRAPH theory, MATCHING theory, COMPUTER science, REPRESENTATIONS of graphs, GRAPH algorithms

Stochastic Analysis of Partitioning Algorithms for Matching Problems

Autoři: Rüschendorf, Ludger Sachs, Gernot

Zdroj: Journal of Applied Probability, 2000 Jun 01. 37(2), 494-503.

Přístupová URL adresa: https://www.jstor.org/stable/3215723

The Application of the SubChain Salp Swarm Algorithm in the Less-Than-Truckload Freight Matching Problem

Autoři: Yibo Sun Lei Yue Yi Liu a další

Zdroj: Applied Sciences, Vol 15, Iss 8, p 4436 (2025)

Témata: less-than-truckload freight matching, SubChain Salp Swarm Algorithm, SubChain operation, Technology, Engineering (General). Civil engineering (General), TA1-2040, Biology (General), QH301-705.5, Physics, QC1-999, Chemistry, QD1-999

Popis souboru: electronic resource

Relation: https://www.mdpi.com/2076-3417/15/8/4436; https://doaj.org/toc/2076-3417

Přístupová URL adresa: https://doaj.org/article/4fe1c02522964f8c8505387ece9b74d8

Numerical Solution and Accuracy Improvement of Garment Size Matching Problem Based on Optimization Algorithm.

Autoři: Hou, Mengmeng

Zdroj: Journal of Combinatorial Mathematics & Combinatorial Computing; Dec2025, Vol. 127b, p9157-9179, 23p

Témata: OPTIMIZATION algorithms, PARTICLE swarm optimization, MULTI-objective optimization, INDUSTRIAL efficiency, MATHEMATICAL optimization, CLOTHING industry, TEXTILE waste

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems

Autoři: Murakami, Hitoshi Yamaguchi, Yutaro

Témata: Computer Science - Data Structures and Algorithms, Mathematics - Combinatorics, text

URL: http://arxiv.org/abs/2405.02829

An FPT Algorithm for the Exact Matching Problem and NP-Hardness of Related Problems

Autoři: Hitoshi MURAKAMI Yutaro YAMAGUCHI

Zdroj: IEICE Transactions on Information and Systems. 2025, E108.D(3):214-220

Quantum Algorithm for the Multiple String Matching Problem

Autoři: Khadiev, Kamil Serov, Danil

Témata: Quantum Physics, Computer Science - Data Structures and Algorithms, text

URL: http://arxiv.org/abs/2411.14850

An efficient two-heuristic algorithm for the student-project allocation with preferences over projects.

Autoři: Viet, Hoang Huu Uyen, Nguyen Thi Cao, Son Thanh a další

Zdroj: Journal of Intelligent & Fuzzy Systems; Jul2025, Vol. 49 Issue 1, p140-152, 13p

Témata: HEURISTIC algorithms, STUDENT projects, CURRICULUM, LIKES & dislikes, COMPUTER performance, ASSIGNMENT problems (Programming), MATCHING theory

Developing an Optimal Peer-to-Peer Ride-Matching Problem Algorithm with Ride Transfers

Autoři: Amirreza Nickkar Young-Jae Lee Mana Meskar

Zdroj: Transportation Research Record: Journal of the Transportation Research Board. 2676:124-136

Témata: 0502 economics and business, 05 social sciences, 11. Sustainability

An Algorithm for Matching in a (3,3)‐Hypergraph With One‐Sided Preferences Having Quadratic Unpopularity Factor.

Autoři: Singh, Yashdeep Karmakar, Sushanta

Zdroj: Concurrency & Computation: Practice & Experience; 11/30/2025, Vol. 37 Issue 25/26, p1-13, 13p

Témata: MATCHING theory, HYPERGRAPHS, ALGORITHMS, NP-hard problems, APPROXIMATION error

Bin Covering Algorithms in the Second Stage of the Lot to Order Matching Problem

Autoři: Carlyle, M. Knutson, K. Fowler, J.

Zdroj: The Journal of the Operational Research Society, 2001 Nov 01. 52(11), 1232-1243.

Přístupová URL adresa: https://www.jstor.org/stable/822933

The capacity matching problem of the third-party shared manufacturing platform with capacity time windows and order splitting.

Autoři: Zhang, Xumei Cao, Duanyang Dan, Bin a další

Zdroj: International Journal of Production Research. Sep2024, Vol. 62 Issue 17, p6167-6185. 19p.

Témata: *INDUSTRIAL capacity, *SHARING economy, *INFORMATION economy, HEURISTIC algorithms

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

Autoři: Anita Dürr and Nicolas El Maalouly and Lasse Wulf Dürr, Anita El Maalouly, Nicolas a další

Témata: Perfect Matching, Exact Matching, Red-Blue Matching, Approximation Algorithms, Bounded Color Matching, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2023.18
Is Part Of LIPIcs, Volume 275, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2023)

A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem

Autoři: Masoud, Neda Jayakrishnan, R

Zdroj: Transportation Research Part B Methodological. 99(C)

Témata: Ride sharing, Ride matching algorithm, Dynamic ride sharing, On-demand transportation, Passenger transportation, Sharing economy, Multi-modal transportation, cs.DS, math.OC, Applied Mathematics, Civil Engineering, Transportation and Freight Services, Logistics & Transportation

Popis souboru: application/pdf

Přístupová URL adresa: https://escholarship.org/uc/item/9gz505mq
https://escholarship.org/content/qt9gz505mq/qt9gz505mq.pdf

Robust Exact Algorithms for the Euclidean Bipartite Matching Problem

Autoři: Gattani, Akshaykumar Gopalkrishna

Témata: Euclidean Bipartite Matching, Primal Dual Method, Exact Algorithms, Wasserstein Distance, Thesis

URL: http://hdl.handle.net/10919/115662

Solving Ontology Meta-Matching Problem Through an Evolutionary Algorithm With Approximate Evaluation Indicators and Adaptive Selection Pressure

Autoři: Qing Lv Chengcai Jiang He Li

Zdroj: IEEE Access, Vol 9, Pp 3046-3064 (2021)

Témata: Ontology meta-matching, evolution algorithm, approximate evaluation indicator, similarity measure, adaptive selection pressure, Electrical engineering. Electronics. Nuclear engineering, TK1-9971

Popis souboru: electronic resource

Relation: https://ieeexplore.ieee.org/document/9309295/; https://doaj.org/toc/2169-3536

Přístupová URL adresa: https://doaj.org/article/c9fe9f54dcc84d1ca905148f06622f40

An Approximation Algorithm for the Exact Matching Problem in Bipartite Graphs

Autoři: Dürr, Anita Maalouly, Nicolas El Wulf, Lasse

Témata: Computer Science - Data Structures and Algorithms, F.2.0, text

URL: http://arxiv.org/abs/2307.02205

Additional Titles: An Efficient Parallel Matching Algorithm for Linear Ordered Term Tree Pattern Matching Problem ?Learning Algorithms for Ordered Tree Structured Patterns and Their Applications?

Témata: Ordered term tree pattern, Pattern matching, Efficient parallel algorithm, Query learning, Graph convolutional network, Departmental Bulletin Paper., VoR.

URL: http://hdl.handle.net/11478/0002000061
https://fit.repo.nii.ac.jp/records/2000061
https://fit.repo.nii.ac.jp/record/2000061/files/%E7%A6%8F%E5%B7%A5%E5%A4%A7-%E7%B7%8F%E5%90%88%E7%A0%94%E7%A9%B6%E6%A9%9F%E6%A7%8B-%E6%89%80%E5%A0%B16-6.pdf

Combinatorial Algorithms for Server Allocation Problem

Autoři: Sowle, Rachita

Thesis Advisors: Computer Science and#38; Applications, Raghvendra, Sharath, Tripathy, Chittaranjan, Murali, T. M., Zhang, Liqing, Heath, Lenwood S.

Témata: Euclidean bipartite matching, k-server problem, work function algorithm, taxi allocation problem

Popis souboru: ETD; application/pdf

Dostupnost: https://hdl.handle.net/10919/121081

Engineering Fast Algorithms for the Bottleneck Matching Problem

Autoři: Ioannis Panagiotas and Grégoire Pichon and Somesh Singh and Bora Uçar Panagiotas, Ioannis Pichon, Grégoire a další

Témata: bipartite graphs, assignment problem, matching, InProceedings, Text, doc-type:ResearchArticle, publishedVersion

URL: https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.87
Is Part Of LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)