The following pages link to Pseudo-Boolean optimization (Q697569):
Displaying 50 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- Exact solution approaches for bilevel assignment problems (Q276866) (← links)
- Modularity-based decompositions for valued CSP (Q353312) (← links)
- Estimating arrival rate of nonhomogeneous Poisson processes with semidefinite programming (Q378749) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Fast approximate energy minimization with label costs (Q409135) (← links)
- Generalized roof duality and bisubmodular functions (Q412330) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- On finite potential games (Q458983) (← links)
- Data aggregation for \(p\)-median problems (Q491200) (← links)
- Efficient minimization of higher order submodular functions using monotonic Boolean functions (Q507571) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- Minor-embedding in adiabatic quantum computation. II: Minor-universal graph design (Q544830) (← links)
- Classes of submodular constraints expressible by graph cuts (Q606899) (← links)
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- Stability preserving transformations of graphs (Q646718) (← links)
- Boolean-controlled systems via receding horizon and linear programing (Q661011) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- Generalized roof duality (Q714031) (← links)
- Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) (← links)
- Approximability issues for unconstrained and constrained maximization of half-product related functions (Q730001) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Combinatorial structure and randomized subexponential algorithms for infinite games (Q817809) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← 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)
- The expressive power of binary submodular functions (Q967393) (← links)
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem (Q969344) (← links)
- Soft arc consistency revisited (Q969527) (← links)
- Minor-embedding in adiabatic quantum computation. I: The parameter setting problem (Q1007120) (← links)
- Minimization of locally defined submodular functions by optimal soft arc consistency (Q1020491) (← links)
- A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
- Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem (Q1025992) (← links)
- A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
- New algorithms for convex cost tension problem with application to computer vision (Q1040084) (← links)
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm (Q1044764) (← links)
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- Equal risk bounding is better than risk parity for portfolio selection (Q1675564) (← links)
- Fractional 0-1 programming: applications and algorithms (Q1675651) (← links)
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems (Q1694780) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- Genetic algorithm-based multi-criteria project portfolio selection (Q1761925) (← links)
