A weighted perfect matching with constraints on weights of its parts
DOI10.33048/DAIO.2021.28.667zbMATH Open1496.05141OpenAlexW4205346651MaRDI QIDQ5100129FDOQ5100129
Authors: Oleg Duginov 
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
Recommendations
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
- Network flows. Theory, algorithms, and applications.
- Assignment Problems
- Title not available (Why is that?)
- Combinatorial optimization. Theory and algorithms.
- Assignment problems: a golden anniversary survey
- Assignment Problems and the Location of Economic Activities
- 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
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Some Matching Problems for Bipartite Graphs
- Finding a Minimum Circuit in a Graph
- The complexity of restricted spanning tree problems
- The partitioning min-max weighted matching problem
- Balanced optimization problems
- On the History of Combinatorial Optimization (Till 1960)
- Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
- Coloured matchings in bipartite graphs
- Title not available (Why is that?)
- Exact perfect matching in complete graphs
- On combinatorial optimization and mechanism design problems arising at container ports. With a foreword by Prof. Dr. Erwin Pesch
- Planarizing Gadgets for Perfect Matching Do Not Exist
- The exact weighted independent set problem in perfect graphs and related classes
- Solving the single crane scheduling problem at rail transshipment yards
Cited In (13)
- Solving various weighted matching problems with constraints
- Minimizing maximum weight of subsets of a maximum matching in a bipartite graph
- Balanced problems on graphs with categorization of edges
- Bottleneck subset-type restricted matching problems
- The partitioning min-max weighted matching problem
- Weighted restricted 2-matching
- Facets of an assignment problem with 0-1 constraint
- Some graph optimization problems with weights satisfying linear constraints
- Weighted matching as a generic pruning technique applied to optimization constraints
- Maximum weight perfect matching problem with additional disjunctive conflict constraints
- Minimum perfect bipartite matchings and spanning trees under categorization
- Low weight perfect matchings
- Maximum matching of given weight in complete and complete bipartite graphs
This page was built for publication: A weighted perfect matching with constraints on weights of its parts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5100129)
