Pages that link to "Item:Q2954170"
From MaRDI portal
The following pages link to Structural Investigation of Piecewise Linearized Network Flow Problems (Q2954170):
Displaying 12 items.
- Piecewise-linear networks with multimode service strategies (Q1002983) (← links)
- A recognition problem in converting linear programming to network flow models (Q1309143) (← links)
- Staircase compatibility and its applications in scheduling and piecewise linearization (Q1662653) (← links)
- A simplex algorithm for network flow problems with piecewise linear fractional objective function (Q1956474) (← links)
- Energy-efficient timetabling in a German underground system (Q2086323) (← links)
- On recognizing staircase compatibility (Q2093277) (← links)
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph (Q2097180) (← links)
- The clique problem with multiple-choice constraints under a cycle-free dependency graph (Q2192065) (← links)
- Subdivision schemes, network flows and linear optimization (Q2355177) (← links)
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems (Q2468881) (← links)
- Maximum Flow Networks for Stability Analysis of LEGO®Structures (Q2912898) (← links)
- The non-stop disjoint trajectories problem (Q6564192) (← links)