Graph separation techniques for quadratic zero-one programming

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

Panos M. Pardalos, Somesh Jha

Publication date: 1991

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

Full work available at URL: https://doi.org/10.1016/0898-1221(91)90165-z

zbMATH Keywords

divide-and-conquer algorithmquadratic zero-one programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Quadratic programming (90C20) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem, Complexity and Polynomially Solvable Special Cases of QUBO, Computational aspects of a branch and bound algorithm for quadratic zero- one programming, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, The unconstrained binary quadratic programming problem: a survey, Adaptive randomization in network data, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Complexity of uniqueness and local search in quadratic 0-1 programming, Locating facilities which interact: Some solvable cases, A branch and bound algorithm for the maximum clique problem, A new linearization technique for multi-quadratic 0-1 programming problems., Global equilibrium search applied to the unconstrained binary quadratic optimization problem, Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture, Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem

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