Sensitivity analysis of optimal matchings

DOI10.1002/NET.3230110105MaRDI QIDQ3922722zbMATH OpenOpenAlexFDO

Authors Glenn M. Weber

Publication date 1981

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230110105

zbMATH Keywords

sensitivity analysisweighted perfect matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Integer programming (90C10)

Cites work

• Maximum matching and a polyhedron with 0,1-vertices
• Optimal set partitioning, matchings and lagrangian duality
• Paths, Trees, and Flowers

Cited in

(7)

• Algorithms for finding k-best perfect matchings
• Some concepts of stability analysis in combinatorial optimization
• Spanning cactus: complexity and extensions
• Matching problems with generalized upper bound side constraints
• Optimal set partitioning, matchings and lagrangian duality
• A comprehensive simplex-like algorithm for network optimization and perturbation analysis
• A survey of exact and approximation algorithms for linear-parametric optimization problems

This page was built for publication: Sensitivity analysis of optimal matchings

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