Polyhedral studies for the multicut problem in hypergraphs
Conference
·
OSTI ID:36003
The Multicut Problem in Hypergraphs can be defined as follows. Given a hypergraph G = (V, E) with weights assigned to the hyperedges, find a partition of the node set of the hypergraph that satisfies some constraints and minimizes the sum of the weights of the hyperedges whose nodes are divided into more than one subset of the partition. This problem arises in an application on the design of mainframe computers. In this talk we present a polyhedral investigation of the problem and show some computational results of a branch and cut algorithm we implemented for it.
- OSTI ID:
- 36003
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
The connection between the chromatic numbers of a hypergraph and its 1-intersection graph
A polyhedral approach to a constrained assignment problem
Solving multiple knapsack problems by cutting planes
Journal Article
·
Thu Sep 25 00:00:00 EDT 2025
· Discrete Mathematics
·
OSTI ID:3003163
A polyhedral approach to a constrained assignment problem
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36120
Solving multiple knapsack problems by cutting planes
Conference
·
Fri Dec 30 23:00:00 EST 1994
·
OSTI ID:36266