Pages that link to "Item:Q1029635"
From MaRDI portal
The following pages link to A global continuation algorithm for solving binary quadratic programming problems (Q1029635):
Displaying 10 items.
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
- A gradient-based approach for discrete optimum design (Q381494) (← links)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
- An algorithm for nonlinear optimization problems with binary variables (Q711384) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- A continuation approach for solving binary quadratic program based on a class of NCP-functions (Q2344687) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- Adaptive randomization in network data (Q6200871) (← links)
