Pages that link to "Item:Q5928210"
From MaRDI portal
The following pages link to A dynamic domain contraction algorithm for nonconvex piecewise linear network flow problems (Q5928210):
Displaying 10 items.
- A branch-cut-and-price algorithm for the piecewise linear transportation problem (Q319653) (← links)
- Supply chain design considering economies of scale and transport frequencies (Q439589) (← links)
- Attractive force search algorithm for piecewise convex maximization problems (Q694170) (← links)
- A note on maxmin problem (Q2421441) (← links)
- On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems (Q2423820) (← links)
- Maximum flow problem in wireless ad hoc networks with directional antennas (Q2458905) (← 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)
- A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem (Q4602333) (← links)