Pages that link to "Item:Q1880318"

The following pages link to A unified modeling and solution framework for combinatorial optimization problems (Q1880318):

Displaying 24 items.

• \(f\)-flip strategies for unconstrained binary quadratic programming (Q271994) (← links)
• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Probabilistic GRASP-tabu search algorithms for the UBQP problem (Q336712) (← links)
• Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991) (← 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 unified framework for population-based metaheuristics (Q646652) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• Solving group technology problems via clique partitioning (Q877223) (← links)
• A global continuation algorithm for solving binary quadratic programming problems (Q1029635) (← links)
• Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
• The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
• A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• A new modeling and solution approach for the set-partitioning problem (Q2456638) (← links)
• An effective modeling and solution approach for the generalized independent set problem (Q2458909) (← links)
• A new approach for modeling and solving set packing problems (Q2462145) (← links)
• Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221) (← links)
• A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
• Clustering of microarray data via clique partitioning (Q2576442) (← links)
• Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis (Q6496345) (← links)