Block linear majorants in quadratic 0--1 optimization
type: Item
instance of: scholarly article
title: Block linear majorants in quadratic 0--1 optimization
zbMATH Open document ID: 1058.90044
author: Endre Boros
author: Isabella Lari
author: Bruno Simeone
published in: Discrete Applied Mathematics
publication date: 2005-01-31T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 2131571
MaRDI profile type: Publication
full work available at URL: j.dam.2003.09.007
OpenAlex ID: W2084814192
cites work: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
cites work: Upper Bounds on the Order of a Clique of a Graph
cites work: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
cites work: Upper-bounds for quadratic 0-1 maximization
cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
cites work: Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
cites work: A combinatorial column generation algorithm for the maximum stable set problem
cites work: A spinorial formulation of the maximum clique problem of a graph
cites work: Stabilized column generation
cites work: Q4198056
cites work: Q3318541
cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization
cites work: Q4729611
cites work: Q3200885
cites work: On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
cites work: An exact algorithm for the maximum stable set problem
cites work: Q4739657
cites work: Q4763341
cites work: Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
cites work: The Eigenvalues of a Graph and Its Chromatic Number
DOI: 10.1016/J.DAM.2003.09.007
description: scientific article; zbMATH DE number 2131571