Pages that link to "Item:Q2456638"
From MaRDI portal
The following pages link to A new modeling and solution approach for the set-partitioning problem (Q2456638):
Displaying 18 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)
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Linear programming formulation of the set partitioning problem (Q604761) (← links)
- Diversification-driven tabu search for unconstrained binary quadratic problems (Q607875) (← links)
- A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
- A new modeling and solution approach for the number partitioning problem (Q930774) (← links)
- A new approach for modeling and solving set packing problems (Q2462145) (← links)
- A fast approximation algorithm for solving the complete set packing problem (Q2514810) (← links)
- Optimal set-partitioning based on group quality likelihood using partition-growing algorithm (Q2874033) (← 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)
- Valid Inequalities and Separation Algorithms for the Set Partitioning Problem (Q6160432) (← links)
- The set partitioning problem in a quantum context (Q6181360) (← links)
- Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing (Q6556084) (← links)
- New advances for quantum-inspired optimization (Q6609695) (← links)
