Pages that link to "Item:Q4152359"
From MaRDI portal
The following pages link to Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms (Q4152359):
Displaying 50 items.
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals (Q552189) (← links)
- Minimal-cost network flow problems with variable lower bounds on arc flows (Q632657) (← links)
- A genuinely polynomial primal simplex algorithm for the assignment problem (Q686416) (← links)
- An efficient method for nonlinearly constrained networks (Q706946) (← links)
- The practical conversion of linear programmes to network flow models (Q757237) (← links)
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems (Q792216) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- The structure of bases in bicircular matroids (Q912110) (← links)
- A survey of dynamic network flows (Q917417) (← links)
- Controlled rounding for tables with subtotals (Q918619) (← links)
- Solution of large dense transportation problems using a parallel primal algorithm (Q922946) (← links)
- Solving embedded generalized network problems (Q1058978) (← links)
- New labeling procedures for the basis graph in generalized networks (Q1062633) (← links)
- ASEAN industrial cooperation: The case of multi-product capacity expansion (Q1064970) (← links)
- Reoptimization procedures for bounded variable primal simplex network algorithms (Q1066818) (← links)
- Performance evaluation of independent superbasic sets on nonlinear replicated networks (Q1068689) (← links)
- Representing inverses in pure network flow optimization (Q1068691) (← links)
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem (Q1072935) (← links)
- Degeneracy in transportation problems (Q1082263) (← links)
- Network generation using the Prufer code (Q1088882) (← links)
- A transportation type aggregate production model with bounds on inventory and backordering (Q1099068) (← links)
- Network flow problems with one side constraint: A comparison of three solution methods (Q1102172) (← links)
- A polynomial algorithm for b-matchings: An alternative approach (Q1109690) (← links)
- Confidentiality control of tabulated data: Some practical network models (Q1127145) (← links)
- Levelling terrain trees: A transshipment problem (Q1145618) (← links)
- The multicommodity assignment problem: A network aggregation heuristic (Q1147630) (← links)
- A fuzzy transportation algorithm (Q1168890) (← links)
- Investments in stochastic maximum flow networks (Q1176860) (← links)
- On the computational behavior of a polynomial-time network flow algorithm (Q1190598) (← links)
- An evaluation of mathematical programming and minicomputers (Q1250035) (← links)
- An implementation of linear and nonlinear multicommodity network flows (Q1268228) (← links)
- Dynamic factorization in large-scale optimization (Q1330893) (← links)
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning (Q1339139) (← links)
- An incremental primal-dual method for generalized networks (Q1342940) (← links)
- Automatic decrease of the penalty parameter in exact penalty function methods (Q1388859) (← links)
- A hybrid algorithm for solving network flow problems with side constraints. (Q1406684) (← links)
- A tabu search heuristic procedure for the fixed charge transportation problem (Q1609908) (← links)
- Optimal configuration of power distribution networks with variable renewable energy resources (Q1652686) (← links)
- An implementation of Newton-like methods on nonlinearly constrained networks (Q1765533) (← links)
- Solution of constrained generalized transportation problems using the pivot and probe algorithm (Q1820696) (← links)
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594) (← links)
- Finite method for a nonlinear allocation problem (Q1896578) (← links)
- A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks (Q1926925) (← links)
- Non-equilibrium statistical physics of currents in queuing networks (Q1958566) (← links)
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization (Q1969833) (← links)
- Solving real-life vehicle routing problems efficiently using tabu search (Q2367019) (← links)
- Minimum-cost flow algorithms: an experimental evaluation (Q2943810) (← links)
- Solving the Nearly Symmetric All-Pairs Shortest-Path Problem (Q3386762) (← links)
- Large-scale linear programming: Geometry, working bases and factorizations (Q3664825) (← links)
- Computational aspects of two-segment separable programming (Q3664835) (← links)
