Pages that link to "Item:Q5312759"
From MaRDI portal
The following pages link to Branch and bound algorithms for the multidimensional assignment problem (Q5312759):
Displaying 13 items.
- A branch-and-bound algorithm for the coupled task problem (Q406642) (← links)
- Local search heuristics for the multidimensional assignment problem (Q544814) (← links)
- Branch and bound algorithm for multidimensional scaling with city-block metric (Q1029698) (← links)
- Clique facets of the axial and planar assignment polytopes (Q1040085) (← links)
- The constant objective value property for multidimensional assignment problems (Q1751146) (← links)
- Resolution search and dynamic branch-and-bound (Q1810862) (← links)
- Integer programming models for the multidimensional assignment problem with star costs (Q2256320) (← links)
- Graph partitions for the multidimensional assignment problem (Q2450905) (← links)
- Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking (Q2634668) (← links)
- Branch-and-bound and objective branching with three or more objectives (Q2676405) (← links)
- Branch and bound solution of the multidimensional assignment problem formulation of data association (Q2905350) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM (Q5038210) (← links)
