The following pages link to (Q4488862):
Displayed 13 items.
- Supply chain design considering economies of scale and transport frequencies (Q439589) (← links)
- Global and local search algorithms for concave cost transshipment problems (Q811873) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- Complexity analysis for maximum flow problems with arc reversals (Q965819) (← links)
- Local smooth representations of parametric semiclosed polyhedra with applications to sensitivity in piecewise linear programs (Q1935266) (← 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)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- Dynamic slope scaling procedure and Lagrangian relaxation with subproblem approximation (Q2505552) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- COLE: a new heuristic approach for fixed charge problem computational results (Q2573014) (← links)
- Modeling and solving a multimodal transportation problem with flexible-time and scheduled services (Q3076017) (← links)