A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1203238 (Why is no real title available?)
- scientific article; zbMATH DE number 1199854 (Why is no real title available?)
- 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
- 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
Cited in
(16)- scientific article; zbMATH DE number 4116303 (Why is no real title available?)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- The unconstrained binary quadratic programming problem: a survey
- Unconstrained quadratic bivalent programming problem
- A tight lower bound for a special case of quadratic 0-1 programming
- Experiments in quadratic 0-1 programming
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- scientific article; zbMATH DE number 2154265 (Why is no real title available?)
- A trust branching path heuristic for zero-one programming
- An algorithm for quadratic zero-one programs
- Building an iterative heuristic solver for a quantum annealer
- A new approach for modeling and solving set packing problems
- An evolutionary heuristic for quadratic 0-1 programming
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)
