The hypergraph assignment problem

DOI10.1016/J.DISOPT.2014.11.002MaRDI QIDQ2339846zbMATH OpenOpenAlexFDO

Authors 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

assignmenthypergraphextended formulationbipartite hypergraph

Mathematics Subject Classification ID

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

Recommendations

• On a hypergraph matching problem
• scientific article; zbMATH DE number 4193445
• The \(\beta\)-assignment problem in general graphs
• The \(k\)-cardinality assignment problem
• The -connected assignment problem
• scientific article; zbMATH DE number 120352
• Partitioning problems in dense hypergraphs
• scientific article; zbMATH DE number 5762364
• On optimization problems in acyclic hypergraphs
• Graph partitions for the multidimensional assignment problem

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A hypergraph model for railway vehicle rotation planning
• Algorithms for the Assignment and Transportation Problems
• Directed hypergraphs and applications
• Flows on hypergraphs
• Gainfree Leontief substitution flow problems
• Hall's theorem for hypergraphs
• Maximum bounded 3-dimensional matching is MAX SNP-complete
• Minimum cost hyperassignments with applications to ICE/IC rotation planning

Cited in

(9)

• A hypergraph network simplex algorithm
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
• The \(\beta\)-assignment problem in general graphs
• A hypergraph model for railway vehicle rotation planning
• Robust assignments via ear decompositions and randomized rounding
• Minimum cost hyperassignments with applications to ICE/IC rotation planning
• The cycle embedding problem
• Timetable sparsification by rolling stock rotation optimization
• Perfect matching in bipartite hypergraphs subject to a demand graph

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)