The equipartition polytope. I: formulations, dimension and basic facets

Authors:
M. Conforti;M. R. Rao;A. Sassano
Affiliations:
-;-;-
Venue:
Mathematical Programming: Series A and B
Year:
1990

Citing 0
Cited 4

A polyhedral approach for a constrained quadratic 0-1 problem

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A polyhedral approach for a constrained quadratic 0-1 problem

Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A comparative study of linear and semidefinite branch-and-cut methods for solving the minimum graph bisection problem

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Facet-defining inequalities for the simple graph partitioning polytope

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract