The max-cut problem and quadratic 0–1 optimization; polyhedral aspects, relaxations and bounds

This publication has 46 references indexed in Scilit:

• The orientation of modules based on graph decomposition
  IEEE Transactions on Computers, 1991
• On the equivalence of paved-duality and standard linearization in nonlinear 0–1 optimization
  Discrete Applied Mathematics, 1990
• Upper-bounds for quadratic 0–1 maximization
  Operations Research Letters, 1990
• The CW-Inequalities for Vectors in l1
  European Journal of Combinatorics, 1990
• A decomposition method for minimizing quadratic pseudo-Boolean functions
  Operations Research Letters, 1989
• On clustering problems with connected optima in euclidean spaces
  Discrete Mathematics, 1989
• Collective computational properties of neural networks: New learning mechanisms
  Physical Review A, 1986
• Matroids and Multicommodity Flows
  European Journal of Combinatorics, 1981
• Maximum likelihood paired comparison ranking by linear programming
  Biometrika, 1969
• On the notion of balance of a signed graph.
  The Michigan Mathematical Journal, 1953