Pages that link to "Item:Q1809845"

The following pages link to An evolutionary heuristic for quadratic 0-1 programming (Q1809845):

Displaying 24 items.

• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• A hybrid data mining GRASP with path-relinking (Q336726) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Solving unconstrained binary quadratic programming problem by global equilibrium search (Q464982) (← 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 effective branch-and-bound algorithm for convex quadratic integer programming (Q715081) (← links)
• An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
• ``Miniaturized'' linearizations for quadratic 0/1 problems (Q817208) (← links)
• A linearization framework for unconstrained quadratic (0-1) problems (Q1025991) (← links)
• One-pass heuristics for large-scale unconstrained binary quadratic problems (Q1600836) (← links)
• Making a state-of-the-art heuristic faster with data mining (Q1639223) (← links)
• Linear and quadratic programming approaches for the general graph partitioning problem (Q1959249) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• Min-Max MPC based on a network problem (Q2474457) (← links)
• Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
• Hybridization of GRASP metaheuristic with data mining techniques (Q2506213) (← links)
• A variable-grouping based genetic algorithm for large-scale integer programming (Q2509223) (← links)
• A hybrid data mining metaheuristic for the <i>p</i>‐median problem (Q4969775) (← links)