Pages that link to "Item:Q3693267"

The following pages link to Roof duality, complementation and persistency in quadratic 0–1 optimization (Q3693267):

Displaying 50 items.

• Distributionally robust mixed integer linear programs: persistency models with applications (Q296964) (← links)
• Generalized roof duality and bisubmodular functions (Q412330) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Block linear majorants in quadratic 0--1 optimization (Q705499) (← links)
• Generalized roof duality (Q714031) (← links)
• Multi-target tracking by online learning a CRF model of appearance and motion patterns (Q740415) (← links)
• Algorithms for the maximum satisfiability problem (Q753502) (← links)
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
• Upper-bounds for quadratic 0-1 maximization (Q913658) (← links)
• Probabilistic bounds and algorithms for the maximum satisfiability problem (Q920845) (← links)
• A network approach for specially structured linear programs arising in 0-1 quadratic optimization (Q943852) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• A pseudo-Boolean consensus approach to nonlinear 0-1 optimization (Q955309) (← links)
• Analyzing quadratic unconstrained binary optimization problems via multicommodity flows (Q967446) (← links)
• Soft arc consistency revisited (Q969527) (← links)
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
• Persistency and matroid intersection (Q1035281) (← links)
• Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions (Q1069444) (← links)
• A solvable case of quadratic 0-1 programming (Q1079494) (← links)
• Quadratic functions with exponential number of local maxima (Q1079496) (← links)
• Penalty formulation for zero-one nonlinear programming (Q1091262) (← links)
• An extension of the König-Egerváry property to node-weighted bidirected graphs (Q1108202) (← links)
• The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
• Experiments in quadratic 0-1 programming (Q1123806) (← links)
• On the equivalence of paved-duality and standard linearization in nonlinear 0-1 optimization (Q1174434) (← links)
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
• Persistency in quadratic 0-1 optimization (Q1190604) (← links)
• A solvable class of quadratic 0-1 programming (Q1193723) (← links)
• Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization (Q1276959) (← links)
• Ranking in quadratic integer programming problems (Q1278381) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
• On the equivalence between roof duality and Lagrangian duality for unconstrained \(0\)-\(1\) quadratic programming problems (Q1314325) (← links)
• Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
• A linear programming approach to reasoning about probabilities (Q1356219) (← links)
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
• Cluster analysis and mathematical programming (Q1365055) (← links)
• Some thoughts on combinatorial optimisation (Q1388818) (← links)
• Thermostatistical persistency: A powerful improving concept for simulated annealing algorithms (Q1390245) (← links)
• Boosting quantum annealer performance via sample persistence (Q1674555) (← links)
• An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
• A simultaneous lifting strategy for identifying new classes of facets for the Boolean quadric polytope (Q1892658) (← links)
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming (Q1905964) (← links)