Pages that link to "Item:Q517297"
From MaRDI portal
The following pages link to Quadratic reformulations of nonlinear binary optimization problems (Q517297):
Displaying 18 items.
- Quadratization of symmetric pseudo-Boolean functions (Q260013) (← links)
- An accelerated procedure for solving binary optimization problems (Q404203) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Modeling the Costas array problem in QUBO for quantum annealing (Q2163794) (← links)
- Optimal quadratic reformulations of fourth degree pseudo-Boolean functions (Q2193002) (← links)
- On the impact of running intersection inequalities for globally solving polynomial optimization problems (Q2195679) (← links)
- Theoretical and computational study of several linearisation techniques for binary quadratic problems (Q2288865) (← links)
- Compact quadratizations for pseudo-Boolean functions (Q2307493) (← links)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5919301) (← links)
- Optimal Seating Assignment in the COVID-19 Era via Quantum Computing (Q6110176) (← links)
- Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences (Q6561231) (← links)
- New advances for quantum-inspired optimization (Q6609695) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)
- Quantum computing and tensor networks for laminate design: a novel approach to stacking sequence retrieval (Q6641922) (← links)
