scientific article; zbMATH DE number 1488074

MaRDI QIDQ4495174zbMATH OpenFDO

Authors Fred Glover, Gary A. Kochenberger, Bahram Alidaee, Mohammad M. Amini

Publication date 10 August 2000

zbMATH Keywords

binary quadratic programstabu search

Mathematics Subject Classification ID

Search theory (90B40) Boolean programming (90C09) Quadratic programming (90C20)

Recommendations

• Adaptive memory tabu search for binary quadratic programs
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• Tabu Search Applied to the Quadratic Assignment Problem
• Tabu Search—Part II

Cited in

(16)

• One-pass heuristics for large-scale unconstrained binary quadratic problems
• An evolutionary heuristic for quadratic 0-1 programming
• Building an iterative heuristic solver for a quantum annealer
• An effective modeling and solution approach for the generalized independent set problem
• A new approach for modeling and solving set packing problems
• Using \(xQx\) to model and solve the uncapacitated task allocation problem
• Clustering of microarray data via clique partitioning
• Adaptive memory tabu search for binary quadratic programs
• The unconstrained binary quadratic programming problem: a survey
• scientific article; zbMATH DE number 1054947 (Why is no real title available?)
• Efficient branch-and-bound algorithms for weighted MAX-2-SAT
• The case for strategic oscillation
• The quadratic knapsack problem
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Solving the maximum edge weight clique problem via unconstrained quadratic programming

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495174)