Roof duality, complementation and persistency in quadratic 0–1 optimization
From MaRDI portal
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
- A Selection Problem of Shared Fixed Costs and Network Flows
- An analysis of approximations for maximizing submodular set functions—I
- Boolean Elements in Combinatorial Optimization
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3848971 (Why is no real title available?)
- scientific article; zbMATH DE number 3717129 (Why is no real title available?)
- scientific article; zbMATH DE number 3461842 (Why is no real title available?)
- scientific article; zbMATH DE number 3473554 (Why is no real title available?)
- scientific article; zbMATH DE number 3564765 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3298475 (Why is no real title available?)
- scientific article; zbMATH DE number 3296915 (Why is no real title available?)
- Methods of Nonlinear 0-1 Programming
- On the integer-valued variables in the linear vertex packing problem
- Quadratic knapsack problems
- Shortest Path and Network Flow Algorithms
- Some Properties of Graphs with Multiple Edges
- The complexity of theorem-proving procedures
- Vertex packings: Structural properties and algorithms
- Vertices Belonging to All or to No Maximum Stable Sets of a Graph
Cited in
(79)- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem
- Persistency and matroid intersection
- Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions
- A solvable case of quadratic 0-1 programming
- Quadratic functions with exponential number of local maxima
- Penalty formulation for zero-one nonlinear programming
- An extension of the König-Egerváry property to node-weighted bidirected graphs
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Persistency in quadratic 0-1 optimization
- A solvable class of quadratic 0-1 programming
- Optimal design of a distributed network with a two-level hierarchical structure
- Linear programming for the \(0-1\) quadratic knapsack problem
- Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
- Ranking in quadratic integer programming problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- On the equivalence between roof duality and Lagrangian duality for unconstrained 0-1 quadratic programming problems
- Minimization of a quadratic pseudo-Boolean function
- A linear programming approach to reasoning about probabilities
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- Cluster analysis and mathematical programming
- Some thoughts on combinatorial optimisation
- Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms
- Boosting quantum annealer performance via sample persistence
- An evolutionary heuristic for quadratic 0-1 programming
- A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Persistency of linear programming relaxations for the stable set problem
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Combinatorial optimization of the discretized multiphase Mumford-Shah functional
- Unconstrained 0-1 optimization and Lagrangean relaxation
- Efficient global minimization methods for image segmentation models with four regions
- A framework for certified Boolean branch-and-bound optimization
- MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A polyhedral study of lifted multicuts
- Distributionally robust mixed integer linear programs: persistency models with applications
- scientific article; zbMATH DE number 3845638 (Why is no real title available?)
- scientific article; zbMATH DE number 3848971 (Why is no real title available?)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
- Roof duality for polynomial 0–1 optimization
- Approximations of pseudo-Boolean functions; applications to game theory
- Generalized roof duality and bisubmodular functions
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- scientific article; zbMATH DE number 4114373 (Why is no real title available?)
- A polynomial case of convex integer quadratic programming problems with box integer constraints
- Persistency of linear programming relaxations for the stable set problem
- Introduction to QUBO
- Autarkies and Persistencies for QUBO
- Mathematical programming models and exact algorithms
- Quadratic reformulations of nonlinear binary optimization problems
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- A branch and bound algorithm for the maximum clique problem
- Best reduction of the quadratic semi-assignment problem
- Persistency in combinatorial optimization problems on matroids
- Efficient joint object matching via linear programming
- Faster exact solution of sparse maxcut and QUBO problems
- Inductive linearization for binary quadratic programs with linear constraints: a computational study
- Concave extensions for nonlinear 0-1 maximization problems
- The pseudo-Boolean polytope and polynomial-size extended formulations for binary polynomial optimization
- Pseudo-Boolean optimization
- Block linear majorants in quadratic 0--1 optimization
- Generalized roof duality
- Multi-target tracking by online learning a CRF model of appearance and motion patterns
- Algorithms for the maximum satisfiability problem
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Upper-bounds for quadratic 0-1 maximization
- Probabilistic bounds and algorithms for the maximum satisfiability problem
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
- A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
- A pseudo-Boolean consensus approach to nonlinear 0-1 optimization
- Analyzing quadratic unconstrained binary optimization problems via multicommodity flows
- Soft arc consistency revisited
This page was built for publication: Roof duality, complementation and persistency in quadratic 0–1 optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3693267)
