The following pages link to Pseudo-Boolean optimization (Q697569):
Displaying 50 items.
- 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)
- On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713) (← links)
- Pseudo-Boolean optimization with a disjunctive constraint (Q1842348) (← 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)
- Minimizing energies with hierarchical costs (Q1931618) (← links)
- FPGA implementation of a stochastic neural network for monotonic pseudo-Boolean optimization (Q1932035) (← links)
- Branch-and-mincut: global optimization for image segmentation with high-level priors (Q1932989) (← links)
- Berge-acyclic multilinear 0-1 optimization problems (Q1991264) (← links)
- A case study in programming a quantum annealer for hard operational planning problems (Q2018131) (← links)
- Exact solution approach for a class of nonlinear bilevel knapsack problems (Q2018478) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Pseudo-Boolean conditional optimization models for a class of multiple traveling salesmen problems (Q2069675) (← links)
- The potential of quantum annealing for rapid solution structure identification (Q2074663) (← links)
- Quadratic and higher-order unconstrained binary optimization of railway rescheduling for quantum computing (Q2104772) (← links)
- Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
- On some variants of the merging variables based \((1+1)\)-evolutionary algorithm with application to MaxSAT problem (Q2117621) (← links)
- Weighted model counting without parameter variables (Q2118293) (← links)
- Efficient local search for pseudo Boolean optimization (Q2118314) (← links)
- Fast three-valued abstract bit-vector arithmetic (Q2152654) (← links)
- Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
- On the complexity and approximation of the maximum expected value all-or-nothing subset (Q2192058) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings (Q2193778) (← links)
- Cuts in undirected graphs. I (Q2215599) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- Multiagent resource allocation in \(k\)-additive domains: preference representation and complexity (Q2271865) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
- Optimal testing and repairing a failed series system (Q2369986) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- From matchings to independent sets (Q2403787) (← links)
- A framework for certified Boolean branch-and-bound optimization (Q2429985) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← 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)
