The following pages link to NETGEN (Q21219):
Displaying 50 items.
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Network repair crew scheduling and routing for emergency relief distribution problem (Q320672) (← links)
- A model-based approach and analysis for multi-period networks (Q353173) (← links)
- Algorithms for the quickest path problem and the reliable quickest path problem (Q373197) (← links)
- A specialized network simplex algorithm for the constrained maximum flow problem (Q531424) (← links)
- Bounded-degree spanning tree problems: models and new algorithms (Q632386) (← links)
- A least-squares minimum-cost network flow algorithm (Q646641) (← links)
- The biobjective undirected two-commodity minimum cost flow problem (Q707093) (← links)
- Modeling the satellite placement problem as a network flow problem with one side constraint (Q751497) (← links)
- A comparison of pivot selection rules for primal simplex based network codes (Q794141) (← links)
- The maximum flow problem: A max-preflow approach (Q811325) (← links)
- Stochastic and dynamic shipper carrier network design problem (Q844134) (← links)
- Multiple objective minimum cost flow problems: a review (Q853016) (← links)
- Using error bounds to compare aggregated generalized transportation models (Q863575) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- The auction algorithm for the transportation problem (Q918416) (← links)
- Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
- A surrogate and Lagrangian approach to constrained network problems (Q920831) (← links)
- A two-phase algorithm for the biobjective integer minimum cost flow problem (Q1000988) (← links)
- Finding non-dominated solutions in bi-objective integer network flow problems (Q1010260) (← links)
- An XML-based schema for stochastic programs (Q1026581) (← links)
- A primal-dual simplex algorithm for bi-objective network flow problems (Q1041407) (← links)
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Network generation using the Prufer code (Q1088882) (← links)
- Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
- Dual coordinate step methods for linear network flow problems (Q1115790) (← links)
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem (Q1143947) (← links)
- A classroom/time assignment model (Q1158092) (← links)
- On the budget-restricted max flow problem (Q1159128) (← links)
- A network penalty method (Q1174423) (← links)
- Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization (Q1180603) (← links)
- Efficient solutions for the bicriteria network flow problem (Q1202272) (← links)
- Primal-dual proximal point algorithm for linearly constrained convex programming problems (Q1203067) (← links)
- On the dual coordinate ascent approach for nonlinear networks (Q1207203) (← links)
- Solving singularly constrained generalized network problems (Q1245161) (← links)
- The generalized alternating path algorithm for transportation problems (Q1245652) (← links)
- A robustness approach to uncapacitated network design problems (Q1278322) (← links)
- Algorithms for network piecewise-linear programs: A comparative study (Q1278601) (← links)
- Computational investigations of maximum flow algorithms (Q1278652) (← links)
- A generic auction algorithm for the minimum cost network flow problem (Q1315446) (← links)
- Parallel primal-dual methods for the minimum cost flow problem (Q1315451) (← links)
- The auction algorithm: A distributed relaxation method for the assignment problem (Q1320412) (← links)
- On the complexity of the dual method for maximum balanced flows (Q1324690) (← links)
- Computing maximum mean cuts (Q1329796) (← links)
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations (Q1342646) (← links)
- Applying steepest-edge techniques to a network primal-dual algorithm (Q1362969) (← links)
- Efficient parallel algorithms for the minimum cost flow problem (Q1379929) (← links)
- Automatic decrease of the penalty parameter in exact penalty function methods (Q1388859) (← links)
- Network simplex algorithm for the general equal flow problem. (Q1406491) (← links)
