Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
From MaRDI portal
Cited in
(61)- Solving embedded generalized network problems
- New labeling procedures for the basis graph in generalized networks
- ASEAN industrial cooperation: The case of multi-product capacity expansion
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Performance evaluation of independent superbasic sets on nonlinear replicated networks
- Representing inverses in pure network flow optimization
- Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
- Degeneracy in transportation problems
- Network generation using the Prufer code
- A transportation type aggregate production model with bounds on inventory and backordering
- Network flow problems with one side constraint: A comparison of three solution methods
- A polynomial algorithm for b-matchings: An alternative approach
- Confidentiality control of tabulated data: Some practical network models
- Levelling terrain trees: A transshipment problem
- The multicommodity assignment problem: A network aggregation heuristic
- A fuzzy transportation algorithm
- Investments in stochastic maximum flow networks
- On the computational behavior of a polynomial-time network flow algorithm
- An evaluation of mathematical programming and minicomputers
- An implementation of linear and nonlinear multicommodity network flows
- Dynamic factorization in large-scale optimization
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning
- An incremental primal-dual method for generalized networks
- Automatic decrease of the penalty parameter in exact penalty function methods
- A hybrid algorithm for solving network flow problems with side constraints.
- A tabu search heuristic procedure for the fixed charge transportation problem
- Optimal configuration of power distribution networks with variable renewable energy resources
- An implementation of Newton-like methods on nonlinearly constrained networks
- Solution of constrained generalized transportation problems using the pivot and probe algorithm
- The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
- Finite method for a nonlinear allocation problem
- A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks
- Non-equilibrium statistical physics of currents in queuing networks
- Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
- Solving real-life vehicle routing problems efficiently using tabu search
- Minimum-cost flow algorithms: an experimental evaluation
- Solving the nearly symmetric all-pairs shortest-path problem
- Large-scale linear programming: Geometry, working bases and factorizations
- Computational aspects of two-segment separable programming
- Extracting embedded generalized networks from linear programming problems
- A hybrid algorithm for solving convex separable network flow problems
- Primal transportation and transshipment algorithms
- A new algorithm for the assignment problem
- Single Commodity Representation of Multicommodity Networks
- Testing of a large-scale network optimization program
- On equivalent representations of certain multicommodity networks as single commodity flow problems
- scientific article; zbMATH DE number 1423919 (Why is no real title available?)
- scientific article; zbMATH DE number 1444279 (Why is no real title available?)
- BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT
- A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals
- Minimal-cost network flow problems with variable lower bounds on arc flows
- A genuinely polynomial primal simplex algorithm for the assignment problem
- An efficient method for nonlinearly constrained networks
- Finding conflict-free minimum weight spanning trees using maximal stable sets of the conflict graph
- The practical conversion of linear programmes to network flow models
- An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems
- On large scale nonlinear network optimization
- The structure of bases in bicircular matroids
- A survey of dynamic network flows
- Controlled rounding for tables with subtotals
- Solution of large dense transportation problems using a parallel primal algorithm
This page was built for publication: Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4152359)
