Sensitivity analysis of optimal matchings
From MaRDI portal
Publication:3922722
DOI10.1002/net.3230110105zbMath0469.05052OpenAlexW2129301137MaRDI QIDQ3922722
Publication date: 1981
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230110105
Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Algorithms for finding k-best perfect matchings, Matching problems with generalized upper bound side constraints, Spanning cactus: complexity and extensions, Some concepts of stability analysis in combinatorial optimization, A comprehensive simplex-like algorithm for network optimization and perturbation analysis, Optimal set partitioning, matchings and lagrangian duality
Cites Work
