Pages that link to "Item:Q1850977"

The following pages link to Greedy and local search heuristics for unconstrained binary quadratic programming (Q1850977):

Displaying 24 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Constructing uniform designs: A heuristic integer programming method (Q413474) (← links)
• A variable depth search branching (Q453047) (← links)
• Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT (Q535012) (← links)
• Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← 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)
• An effective local search for the maximum clique problem (Q1041822) (← links)
• Modeling and heuristics for production time crashing in supply chain network design (Q2173131) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• An effective genetic algorithm approach to large scale mixed integer programming problems (Q2489337) (← links)
• A variable-grouping based genetic algorithm for large-scale integer programming (Q2509223) (← links)
• Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
• Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
• Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes (Q4969701) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• Metaheuristic Algorithms (Q5050149) (← links)
• What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO (Q5136083) (← links)
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem (Q5945202) (← links)
• A quadratic simplex algorithm for primal optimization over zero-one polytopes (Q6202952) (← links)