Matching problems with generalized upper bound side constraints

DOI10.1002/NET.3230200602MaRDI QIDQ3204346zbMATH OpenOpenAlexFDO

Authors Michael O. Ball, Ulrich Derigs, C. Hilbrand, A. Metz

Publication date 1990

Published in Networks (Search for Journal in Brave)

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

zbMATH Keywords

approximate solutiondual ascentgeneralized upper bound side constraintsLagrangean relaxationweighted nonbipartite matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 125292
• scientific article; zbMATH DE number 515943
• Solving (large scale) matching problems combinatorially
• Solving various weighted matching problems with constraints
• A new algorithm for general matching problems using network flow subproblems

Cites work

• A shortest augmenting path method for solving minimal perfect matching problems
• scientific article; zbMATH DE number 3858858 (Why is no real title available?)
• scientific article; zbMATH DE number 3900499 (Why is no real title available?)
• scientific article; zbMATH DE number 3637616 (Why is no real title available?)
• Maximum matching and a polyhedron with 0,1-vertices
• Optimal set partitioning, matchings and lagrangian duality
• Optimization with nonsmooth data
• Sensitivity analysis of optimal matchings
• Some basic exchange properties in combinatorial optimization and their application to constructing the k-best solutions

Cited in

(9)

• A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Matching problems in selective assembly operations
• The matching relaxation for a class of generalized set partitioning problems
• A constrained matching problem
• The singly constrained assignment problem: An AP basis algorithm
• Assignment problem with conflicts
• scientific article; zbMATH DE number 125292 (Why is no real title available?)
• scientific article; zbMATH DE number 176477 (Why is no real title available?)

This page was built for publication: Matching problems with generalized upper bound side constraints

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