Pages that link to "Item:Q3845817"
From MaRDI portal
The following pages link to An approximative algorithm for the fixed-charges transportation problem (Q3845817):
Displaying 15 items.
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- On the use of tree indexing methods in transportation algorithms (Q1247921) (← links)
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure (Q1306360) (← links)
- A set covering reformulation of the pure fixed charge transportation problem (Q1317046) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Probabilistic local search algorithms for concave cost transportation network problems (Q1806939) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- A heuristic algorithm for the fixed charge problem (Q2430567) (← links)
- A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems (Q2459395) (← links)
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems (Q2479831) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Linear-Time Approximation for Maximum Weight Matching (Q3189636) (← links)
- An approximative algorithm for the fixed charge problem (Q5580061) (← links)
- The transportation problem with packing constraints (Q6106585) (← links)
