Pages that link to "Item:Q1962018"
From MaRDI portal
The following pages link to Algorithms and codes for dense assignment problems: The state of the art (Q1962018):
Displayed 14 items.
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
- Worst case examples of an exterior point algorithm for the assignment problem (Q937404) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Solving the \(k\)-cardinality assignment problem by transformation (Q1877052) (← links)
- Mass transportation and the consistency of the empirical optimal conditional locations (Q2430596) (← links)
- Solving the rectangular assignment problem and applications (Q2430614) (← links)
- A branch-and-bound algorithm for the singly constrained assignment problem (Q2432890) (← links)
- Tolerance-based branch and bound algorithms for the ATSP (Q2482753) (← links)
- An algorithm for ranking assignments using reoptimization (Q2483518) (← links)
- An addendum on: ``Sensitivity analysis of the optimal assignment'' (Q2569122) (← links)
- A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM (Q3502867) (← links)
- Matching of objects nodal points improvement using optimization (Q5481768) (← links)
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order (Q5505660) (← links)
- On the initialization methods of an exterior point algorithm for the assignment problem (Q5747723) (← links)