A unified modeling and solution framework for combinatorial optimization problems

DOI10.1007/s00291-003-0153-3zbMath1160.90706OpenAlexW2091402700MaRDI QIDQ1880318

Fred Glover, Bahram Alidaee, Gary A. Kochenberger, César Rego

Publication date: 22 September 2004

Published in: OR Spectrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00291-003-0153-3

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

\(f\)-flip strategies for unconstrained binary quadratic programming, Applications and Computational Advances for Solving the QUBO Model, Building an iterative heuristic solver for a quantum annealer, Solving the maximum vertex weight clique problem via binary quadratic programming, The bipartite quadratic assignment problem and extensions, Probabilistic GRASP-tabu search algorithms for the UBQP problem, Adapting the traveling salesman problem to an adiabatic quantum computer, Solving the maximum edge weight clique problem via unconstrained quadratic programming, Solving group technology problems via clique partitioning, Diversification-driven tabu search for unconstrained binary quadratic problems, Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems, A hybrid metaheuristic approach to solving the UBQP problem, A unified framework for population-based metaheuristics, Solving unconstrained binary quadratic programming problem by global equilibrium search, A new modeling and solution approach for the set-partitioning problem, An effective modeling and solution approach for the generalized independent set problem, A new approach for modeling and solving set packing problems, The generalized independent set problem: polyhedral analysis and solution approaches, Path relinking for unconstrained binary quadratic programming, A computational study on the quadratic knapsack problem with multiple constraints, Using \(xQx\) to model and solve the uncapacitated task allocation problem, Clique Partitioning for Clustering: A Comparison withK-Means and Latent Class Analysis, A fast approximation algorithm for solving the complete set packing problem, A global continuation algorithm for solving binary quadratic programming problems, Clustering of microarray data via clique partitioning