Pages that link to "Item:Q2641083"
From MaRDI portal
The following pages link to Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083):
Displaying 6 items.
- Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
- Comparison of column generation models for channel assignment in cellular networks (Q5946824) (← links)
- Complex portfolio selection via convex mixed‐integer quadratic programming: a survey (Q6070970) (← links)
- Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)
- Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations (Q6670500) (← links)