The \(\beta\)-assignment problem in general graphs

DOI10.1016/S0305-0548(96)00089-5zbMath0894.90149MaRDI QIDQ1370666

Pei-Hsin Ho, Gerard Jennhwa Chang

Publication date: 26 October 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

graphassignment problemperfect matching\(\beta\)-assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Cites Work

• Matching theory
• On a scheduling problem where a job can be executed only by a limited number of processors
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs
• A Short Proof of the Factor Theorem for Finite Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item