A note on formulations for the \(A\)-partition problem on hypergraphs

DOI10.1016/S0166-218X(98)00087-0zbMath0913.68154OpenAlexW2057511886MaRDI QIDQ1276964

Sunil Chopra, Jonathan H. Owen

Publication date: 25 May 1999

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

integer programming formulationshypgergraph

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Greedy splitting algorithms for approximating multiway partition problems ⋮ New approximations and hardness results for submodular partitioning problems

Cites Work

• Unnamed Item
• Unnamed Item
• The ellipsoid method and its consequences in combinatorial optimization
• Extended formulations for the \(A\)-cut problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Equivalence of Memory to “Random Logic”

This page was built for publication: A note on formulations for the \(A\)-partition problem on hypergraphs