Pages that link to "Item:Q1880318"
From MaRDI portal
The following pages link to A unified modeling and solution framework for combinatorial optimization problems (Q1880318):
Displayed 14 items.
- Adapting the traveling salesman problem to an adiabatic quantum computer (Q352991) (← 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)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← 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)
- Clustering of microarray data via clique partitioning (Q2576442) (← links)
- Clique Partitioning for Clustering: A Comparison with<i>K</i>-Means and Latent Class Analysis (Q5451111) (← links)