Pages that link to "Item:Q4859338"

The following pages link to A Decomposition Method for Quadratic Zero-One Programming (Q4859338):

Displaying 34 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← 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)
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem (Q703909) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
• A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem (Q991376) (← links)
• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
• Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
• One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
• A new upper bound for the 0-1 quadratic knapsack problem (Q1806683) (← links)
• An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
• Distributed resource allocation with binary decisions via Newton-like neural network dynamics (Q2021311) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• A Lagrangean decomposition for the maximum independent set problem applied to map labeling (Q2359523) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
• Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
• On the Quadratic Programming Approach for Hub Location Problems (Q3638504) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• (Q5203914) (← links)