Block linear majorants in quadratic 0--1 optimization
From MaRDI portal
Publication:705499
DOI10.1016/j.dam.2003.09.007zbMath1058.90044OpenAlexW2084814192MaRDI QIDQ705499
Bruno Simeone, Isabella Lari, Endre Boros
Publication date: 31 January 2005
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2003.09.007
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper-bounds for quadratic 0-1 maximization
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems
- Stabilized column generation
- On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems
- An exact algorithm for the maximum stable set problem
- A combinatorial column generation algorithm for the maximum stable set problem
- A spinorial formulation of the maximum clique problem of a graph
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization
- Cut-Polytopes, Boolean Quadric Polytopes and Nonnegative Quadratic Pseudo-Boolean Functions
- Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem
- The Eigenvalues of a Graph and Its Chromatic Number
- Upper Bounds on the Order of a Clique of a Graph
