Fachbereich Maschinenbau und Mechatronik
Refine
Year of publication
Institute
- Fachbereich Maschinenbau und Mechatronik (490) (remove)
Document Type
- Article (490) (remove)
Keywords
- Rapid prototyping (5)
- Rapid Prototyping (4)
- SLM (3)
- additive manufacturing (3)
- 3D-Printing (2)
- Brake set-up (2)
- Freight rail (2)
- Rapid Manufacturing (2)
- Stereolithographie (2)
- factory planning (2)
We present a new Min-Max theorem for an optimization problem closely connected to matchings and vertex covers in balanced hypergraphs. The result generalizes Kőnig’s Theorem (Berge and Las Vergnas in Ann N Y Acad Sci 175:32–40, 1970; Fulkerson et al. in Math Progr Study 1:120–132, 1974) and Hall’s Theorem (Conforti et al. in Combinatorica 16:325–329, 1996) for balanced hypergraphs.