A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
From MaRDI portal
Publication:1893147
DOI10.1007/BF02238228zbMath0830.65054OpenAlexW1509122287MaRDI QIDQ1893147
Publication date: 3 July 1995
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238228
combinatorial optimizationbranch and bound algorithmzero-one programmingunconstrained quadratic 0-1 programming
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Boolean programming (90C09)
Related Items
Building an iterative heuristic solver for a quantum annealer ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ A new approach for modeling and solving set packing problems ⋮ A tight lower bound for a special case of quadratic 0-1 programming ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
Cites Work
- Unnamed Item
- Unnamed Item
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A cutting plane algorithm for a clustering problem
- Experiments in quadratic 0-1 programming
- Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An algorithm for quadratic zero-one programs
- Methods of Nonlinear 0-1 Programming
- Construction of test problems in quadratic bivalent programming
- On the facial structure of set packing polyhedra
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
This page was built for publication: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
