The hypergraph assignment problem

DOI10.1016/j.disopt.2014.11.002zbMath1308.90143OpenAlexW1985530626MaRDI QIDQ2339846

Ralf Borndörfer, Olga Heismann

Publication date: 9 April 2015

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2014.11.002

zbMATH Keywords

hypergraphassignmentextended formulationbipartite hypergraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Hypergraphs (05C65) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

Perfect matching in bipartite hypergraphs subject to a demand graph ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Timetable Sparsification by Rolling Stock Rotation Optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Flows on hypergraphs
• Gainfree Leontief substitution flow problems
• Directed hypergraphs and applications
• A Hypergraph Model for Railway Vehicle Rotation Planning
• Algorithms for the Assignment and Transportation Problems
• Hall's theorem for hypergraphs
• Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning

This page was built for publication: The hypergraph assignment problem