The hypergraph assignment problem
From MaRDI portal
Publication:2339846
DOI10.1016/J.DISOPT.2014.11.002zbMATH Open1308.90143OpenAlexW1985530626MaRDI QIDQ2339846FDOQ2339846
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
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Hypergraphs (05C65) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Directed hypergraphs and applications
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- Algorithms for the Assignment and Transportation Problems
- Hall's theorem for hypergraphs
- Flows on hypergraphs
- Gainfree Leontief substitution flow problems
- A hypergraph model for railway vehicle rotation planning
- Minimum Cost Hyperassignments with Applications to ICE/IC Rotation Planning
Cited In (4)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- On a hypergraph matching problem 👍 👎
- The \(k\)-cardinality assignment problem 👍 👎
- The \(\gamma\)-connected assignment problem 👍 👎
- Graph partitions for the multidimensional assignment problem 👍 👎
- Partitioning problems in dense hypergraphs 👍 👎
- The \(\beta\)-assignment problem in general graphs 👍 👎
- On optimization problems in acyclic hypergraphs 👍 👎
This page was built for publication: The hypergraph assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2339846)
