Pages that link to "Item:Q1362973"
From MaRDI portal
The following pages link to A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973):
Displaying 8 items.
- A scatter search-based heuristic to locate capacitated transshipment points (Q878590) (← links)
- Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem (Q881527) (← links)
- Step fixed-charge solid transportation problem: a Lagrangian relaxation heuristic approach (Q2403107) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- (Q4028939) (← links)
- (Q4886440) (← links)
- An Algorithm for Solving Capacitated Multicommodity <i>p</i>-median Transportation Problems (Q5287230) (← links)
- An improved evolutionary algorithm for the two-stage transportation problem with fixed charge at depots (Q5964851) (← links)