The following pages link to (Q4495174):
Displayed 10 items.
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
- The case for strategic oscillation (Q542006) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
- One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)