The following pages link to (Q4845364):
Displaying 26 items.
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals (Q552189) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- A comparison of solution strategies for biobjective shortest path problems (Q958463) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
- An incremental primal-dual method for generalized networks (Q1342940) (← links)
- Network simplex algorithm for the general equal flow problem. (Q1406491) (← links)
- A hybrid algorithm for solving network flow problems with side constraints. (Q1406684) (← links)
- GNU Oflox: an academic software for the minimal cost network flow problem (Q1653929) (← links)
- A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks (Q1758062) (← links)
- The singly constrained assignment problem: An AP basis algorithm (Q1908532) (← links)
- A network simplex algorithm for solving the minimum distribution cost problem (Q2379832) (← links)
- Balanced network flows. VII: Primal-dual algorithms. (Q2782730) (← links)
- Network simplex algorithm for the bi-criteria minimum cost flow over time problem (Q2881179) (← links)
- (Q2932201) (← links)
- Diagnosing Infeasibility in Min-cost Network Flow Problems Part II: Primal Infeasibility (Q3035117) (← links)
- Numerical methods for basic solutions of generalized flow networks (Q3220317) (← links)
- A primal simplex variant for the maximum-flow problem (Q3316928) (← links)
- A note on specialized versus unspecialized methods for maximum-flow problems (Q3316929) (← links)
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks (Q3710290) (← links)
- An efficient implementation of the network simplex method (Q3725834) (← links)
- A Primal Simplex Approach to Pure Processing Networks (Q3750474) (← links)
- Efficiency of the Primal Network Simplex Algorithm for the Minimum-Cost Circulation Problem (Q3978616) (← links)
- (Q5294046) (← links)
