The following pages link to Pseudo-Boolean optimization (Q697569):
Displayed 19 items.
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Quadratic convex reformulations for quadratic 0-1 programming (Q941006) (← 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)
- The expressive power of valued constraints: Hierarchies and collapses (Q959827) (← links)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- Disjunctive analogues of submodular and supermodular pseudo-Boolean functions (Q1878401) (← links)
- Exact and approximate discrete optimization algorithms for finding useful disjunctions of categorical predicates in data analysis (Q1885808) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- The complexity of soft constraint satisfaction (Q2457608) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Cross-layer optimization in ultra wideband networks (Q2463846) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Subset-conjunctive rules for breast cancer diagnosis (Q2489654) (← links)
- A tight lower bound for a special case of quadratic 0-1 programming (Q2492664) (← links)
- New approaches for optimizing over the semimetric polytope (Q2576727) (← links)