Pages that link to "Item:Q2488221"
From MaRDI portal
The following pages link to Using \(xQx\) to model and solve the uncapacitated task allocation problem (Q2488221):
Displaying 8 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- A two-stage approach to solving large capacitated task allocation problems (Q614188) (← links)
- A note on xQx as a modelling and solution framework for the linear ordering problem (Q840578) (← 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)
- Applications and Computational Advances for Solving the QUBO Model (Q5050142) (← links)
- On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem (Q5191123) (← links)
