Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
From MaRDI portal
Publication:4152359
DOI10.1287/mnsc.24.1.1zbMath0373.90079OpenAlexW1997116158MaRDI QIDQ4152359
Gordon H. Bradley, Glenn W. Graves, Gerald G. Brown
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.1.1
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Single Commodity Representation of Multicommodity Networks, Dynamic factorization in large-scale optimization, Degeneracy in transportation problems, A hybrid algorithm for solving convex separable network flow problems, Solving real-life vehicle routing problems efficiently using tabu search, A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning, Network generation using the Prufer code, An incremental primal-dual method for generalized networks, Unnamed Item, Finite method for a nonlinear allocation problem, A transportation type aggregate production model with bounds on inventory and backordering, Unnamed Item, Network flow problems with one side constraint: A comparison of three solution methods, Optimal configuration of power distribution networks with variable renewable energy resources, A polynomial algorithm for b-matchings: An alternative approach, Confidentiality control of tabulated data: Some practical network models, Minimum-cost flow algorithms: an experimental evaluation, A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks, Automatic decrease of the penalty parameter in exact penalty function methods, Levelling terrain trees: A transshipment problem, The multicommodity assignment problem: A network aggregation heuristic, A hybrid algorithm for solving network flow problems with side constraints., Minimal-cost network flow problems with variable lower bounds on arc flows, On large scale nonlinear network optimization, The structure of bases in bicircular matroids, A survey of dynamic network flows, Non-equilibrium statistical physics of currents in queuing networks, Controlled rounding for tables with subtotals, Solution of large dense transportation problems using a parallel primal algorithm, A fuzzy transportation algorithm, Simultaneous lotsizing and scheduling by combining local search with dual reoptimization, Investments in stochastic maximum flow networks, On the computational behavior of a polynomial-time network flow algorithm, A genuinely polynomial primal simplex algorithm for the assignment problem, An implementation of Newton-like methods on nonlinearly constrained networks, A complete and an incomplete algorithm for automated guided vehicle scheduling in container terminals, An efficient method for nonlinearly constrained networks, Primal transportation and transshipment algorithms, An evaluation of mathematical programming and minicomputers, Testing of a large-scale network optimization program, On equivalent representations of certain multicommodity networks as single commodity flow problems, Solving the Nearly Symmetric All-Pairs Shortest-Path Problem, An implementation of linear and nonlinear multicommodity network flows, The practical conversion of linear programmes to network flow models, Solution of constrained generalized transportation problems using the pivot and probe algorithm, BRIDGE LANE DIRECTION SPECIFICATION FOR SUSTAINABLE TRAFFIC MANAGEMENT, A new algorithm for the assignment problem, Large-scale linear programming: Geometry, working bases and factorizations, Computational aspects of two-segment separable programming, An equivalent subproblem relaxation for improving the solution of a class of transportation scheduling problems, The transportation problem with exclusionary side constraints and two branch-and-bound algorithms, 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, Extracting embedded generalized networks from linear programming problems, A tabu search heuristic procedure for the fixed charge transportation problem
