Pages that link to "Item:Q3502867"
From MaRDI portal
The following pages link to A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867):
Displaying 8 items.
- Regularization of DAEs based on the signature method (Q285293) (← links)
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- A labeling algorithm for the sensitivity ranges of the assignment problem (Q651673) (← links)
- A branch-and-branch algorithm for solving the group technology problem (Q922271) (← links)
- Approach to finding the optimal solution in the assignment problem (Q1364115) (← links)
- A branch and bound algorithm for solving a class of D-C programming (Q1780534) (← links)
- Resolution search and dynamic branch-and-bound (Q1810862) (← links)
- Finding multiple solutions to general integer linear programs (Q2384650) (← links)