A note on the parity assignment problem

DOI10.1080/02331930701421038zbMath1149.90089OpenAlexW2169511042MaRDI QIDQ5423148

Peter Butkovic

Publication date: 22 October 2007

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331930701421038

zbMATH Keywords

optimal solutionAssignment problemMonge matrixeven and odd permutations

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Selected topics on assignment problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• Regularity of matrices in min-algebra and its time-complexity
• Max algebra and the linear assignment problem
• Max-algebra: The linear algebra of combinatorics?
• Perspectives of Monge properties in optimization
• Permanents, Pfaffian orientations, and even directed circuits
• Minimal (max,+) Realization of Convex Sequences

This page was built for publication: A note on the parity assignment problem