Pages that link to "Item:Q2277139"
From MaRDI portal
The following pages link to The basic algorithm for pseudo-Boolean programming revisited (Q2277139):
Displaying 26 items.
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Optimization and probabilistic satisfiability on nested and co-nested formulas (Q646722) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Computational complexity of norm-maximization (Q757258) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds (Q1179735) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem (Q1296804) (← links)
- The struction algorithm for the maximum stable set problem revisited (Q1332429) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Cluster analysis and mathematical programming (Q1365055) (← links)
- Struction revisited (Q1414580) (← links)
- Probabilistic satisfiability with imprecise probabilities (Q1605686) (← links)
- Generalization of Barahona's algorithm for cases of integer non-linear programming with box constraints (Q2367400) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
- (Q3429158) (← links)
- A Clustering Approach to Constrained Binary Matrix Factorization (Q4631260) (← links)
- (Q4785535) (← links)
- Complexity and Polynomially Solvable Special Cases of QUBO (Q5050143) (← links)
- (Q5146738) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- Efficient linear reformulations for binary polynomial optimization problems (Q6164618) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)