A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
DOI10.1007/BF02238228zbMATH Open0830.65054OpenAlexW1509122287MaRDI QIDQ1893147FDOQ1893147
Authors: Gintaras Palubeckis 
Publication date: 3 July 1995
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02238228
Recommendations
combinatorial optimizationbranch and bound algorithmzero-one programmingunconstrained quadratic 0-1 programming
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) Boolean programming (90C09)
Cites Work
- On the facial structure of set packing polyhedra
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- A cutting plane algorithm for a clustering problem
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Some Network Flow Problems Solved with Pseudo-Boolean Programming
- Methods of Nonlinear 0-1 Programming
- Experiments in quadratic 0-1 programming
- Complexity of uniqueness and local search in quadratic 0-1 programming
- An algorithm for quadratic zero-one programs
- The indefinite zero-one quadratic problem
- Unconstrained quadratic bivalent programming problem
- Construction of test problems in quadratic bivalent programming
- Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (16)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- 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
- Title not available (Why is that?)
- 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
- Title not available (Why is that?)
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)
