Pages that link to "Item:Q2462145"

The following pages link to A new approach for modeling and solving set packing problems (Q2462145):

Displaying 17 items.

• Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
• The bipartite quadratic assignment problem and extensions (Q322542) (← links)
• Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
• Solving the maximum edge weight clique problem via unconstrained quadratic programming (Q877032) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← links)
• Path relinking for unconstrained binary quadratic programming (Q2253377) (← links)
• Stability evaluation of a railway timetable at station level (Q2378419) (← links)
• A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
• Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem (Q2655608) (← links)
• Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5918755) (← links)
• Quantum bridge analytics. I: A tutorial on formulating and using QUBO models (Q5919301) (← links)
• The set partitioning problem in a quantum context (Q6181360) (← links)