Pages that link to "Item:Q1003485"
From MaRDI portal
The following pages link to A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485):
Displaying 12 items.
- Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) (← links)
- Scheduling last-mile deliveries with truck-based autonomous robots (Q1653394) (← links)
- A strongly polynomial algorithm for the transportation problem (Q1804365) (← links)
- Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs (Q2061134) (← links)
- A heuristic for obtaining better initial feasible solution to the transportation problem (Q2307995) (← links)
- Dynamic capacity management with general upgrading (Q2797459) (← links)
- Faster strongly polynomial algorithms for the unbalanced transportation problem and assignment problem with Monge costs (Q2811304) (← links)
- (Q3081849) (← links)
- POLYNOMIAL TIME INTERIOR POINT ALGORITHMS FOR TRANSPORTATION PROBLEMS (Q3204329) (← links)
- Tight Semi-model-free Bounds on (Bilateral) CVA (Q4689903) (← links)
- Job scheduling under time-of-use energy tariffs for sustainable manufacturing: a survey (Q6112694) (← links)
- Tropical medians by transportation (Q6126667) (← links)
