Graph separation techniques for quadratic zero-one programming

DOI10.1016/0898-1221(91)90165-ZzbMath0717.90050MaRDI QIDQ2638933

Panos M. Pardalos, Somesh Jha

Publication date: 1991

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

divide-and-conquer algorithm; quadratic zero-one programs

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90C60: Abstract computational complexity for mathematical programming problems

90C20: Quadratic programming

90C09: Boolean programming

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Global equilibrium search applied to the unconstrained binary quadratic optimization problem, A branch and bound algorithm for the maximum clique problem, Locating facilities which interact: Some solvable cases, A new linearization technique for multi-quadratic 0-1 programming problems., Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture, Complexity of uniqueness and local search in quadratic 0-1 programming, Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Computational aspects of a branch and bound algorithm for quadratic zero- one programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unconstrained quadratic bivalent programming problem
• A solvable case of quadratic 0-1 programming
• Constrained global optimization: algorithms and applications
• Some simplified NP-complete graph problems
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Methods of Nonlinear 0-1 Programming
• A Separator Theorem for Planar Graphs
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• A Survey of Methods for Pure Nonlinear Integer Programming
• Applications of a Planar Separator Theorem
• Minimum cuts and related problems