Pages that link to "Item:Q2638933"
From MaRDI portal
The following pages link to Graph separation techniques for quadratic zero-one programming (Q2638933):
Displaying 11 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Adaptive randomization in network data (Q6200871) (← links)
