A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(9 intermediate revisions by 5 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Benchmarks for Optimization Software / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPLR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CirCut / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2007.02.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2095464687 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem on graphs not contractible to \(K_ 5\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Persistency in quadratic 0-1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact MAX-2SAT solution via lift-and-project closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper-bounds for quadratic 0-1 maximization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal Cuts and Odd Cycle Inequalities in Quadratic 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elementary closures for integer programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496019 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-pass heuristics for large-scale unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Memory Tabu Search for Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality, complementation and persistency in quadratic 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729611 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the notion of balance of a signed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical evaluation of SBmethod / rank
 
Normal rank
Property / cites work
 
Property / cites work: A spectral bundle method with bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Spectral Bundle Method for Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient branch-and-bound algorithms for weighted MAX-2-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Roof duality for polynomial 0–1 optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An independent benchmarking of SDP and SOCP solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:22, 28 June 2024

scientific article
Language Label Description Also known as
English
A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
scientific article

    Statements

    A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2008
    0 references
    0 references
    roof duality
    0 references
    persistency
    0 references
    network flows
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references