A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
This paper describes a branch and bound algorithm for solving the unconstrained quadratic 0-1 programming problem. The salient features of it are the use of quadratic programming heuristics in the transformation of subproblems and exploiting some classes of facets of the polytope related to the quadratic problem in deriving upper bounds on the objective function. The authors develop facet selection procedures that form a basis of the bound computation algorithm and present computational experience on four series of randomly generated problems and 14 real instances of a quadratic problem arising in design automation. Moreover, the same ideas can also be applied to some other combinatorial optimization problems.
- A cutting plane algorithm for a clustering problem
- An algorithm for quadratic zero-one programs
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Construction of test problems in quadratic bivalent programming
- Experiments in quadratic 0-1 programming
- scientific article; zbMATH DE number 1203238 (Why is no real title available?)
- scientific article; zbMATH DE number 1199854 (Why is no real title available?)
- Methods of Nonlinear 0-1 Programming
- On the facial structure of set packing polyhedra
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
- A trust branching path heuristic for zero-one programming
- Experiments in quadratic 0-1 programming
- An evolutionary heuristic for quadratic 0-1 programming
- Building an iterative heuristic solver for a quantum annealer
- A new approach for modeling and solving set packing problems
- A tight lower bound for a special case of quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for quadratic zero-one programs
- The unconstrained binary quadratic programming problem: a survey
- scientific article; zbMATH DE number 1203238 (Why is no real title available?)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- scientific article; zbMATH DE number 2154265 (Why is no real title available?)
- scientific article; zbMATH DE number 4116303 (Why is no real title available?)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Unconstrained quadratic bivalent programming problem
- An unconstrained quadratic binary programming approach to the vertex coloring problem
This page was built for publication: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1893147)
