A weighted perfect matching with constraints on weights of its parts
From MaRDI portal
Publication:5100129
DOI10.33048/daio.2021.28.667zbMath1496.05141OpenAlexW4205346651MaRDI QIDQ5100129
Publication date: 29 August 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da1279
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The partitioning min-max weighted matching problem
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Balanced optimization problems
- Assignment problems: a golden anniversary survey
- Coloured matchings in bipartite graphs
- On combinatorial optimization and mechanism design problems arising at container ports. With a foreword by Prof. Dr. Erwin Pesch
- Solving the single crane scheduling problem at rail transshipment yards
- The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes
- Planarizing Gadgets for Perfect Matching Do Not Exist
- Assignment Problems and the Location of Economic Activities
- Assignment Problems
- The complexity of restricted spanning tree problems
- Finding a Minimum Circuit in a Graph
- Some Matching Problems for Bipartite Graphs
- Maximum matching of given weight in complete and complete bipartite graphs
- Faster scaling algorithms for general graph matching problems
- Faster Scaling Algorithms for Network Problems
- Exact Perfect Matching in Complete Graphs
- On the History of Combinatorial Optimization (Till 1960)
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Combinatorial optimization. Theory and algorithms.
This page was built for publication: A weighted perfect matching with constraints on weights of its parts
