Pages that link to "Item:Q1600836"

The following pages link to One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836):

Displaying 17 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
• Pseudo-Boolean optimization (Q697569) (← links)
• Generalized roof duality (Q714031) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO) (Q951124) (← links)
• A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
• Carousel greedy: a generalized greedy algorithm with applications in optimization (Q1652355) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← 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)
• Nonsmooth cryptanalysis, with an application to the stream cipher MICKEY (Q2999550) (← links)
• A Computational Framework for Solving Nonlinear Binary Optimization Problems in Robust Causal Inference (Q5060782) (← links)