NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

DOI10.1287/mnsc.20.5.814zbMath0303.90042MaRDI QIDQ4058479

No author found.

Publication date: 1974

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.20.5.814

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C10: Integer programming

90C05: Linear programming

Related Items

Simplicial Decomposition for Convex Generalized Networks, PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS, A proximal subgradient projection algorithm for linearly constrained strictly convex problems, An algorithm for the biobjective integer minimum cost flow problem, Label correcting methods to solve multicriteria shortest path problems, NETGEN, Bounding multi-stage stochastic programs from above, The biobjective undirected two-commodity minimum cost flow problem, Modeling the satellite placement problem as a network flow problem with one side constraint, A parametric algorithm for convex cost network flow and related problems, A comparison of pivot selection rules for primal simplex based network codes, The maximum flow problem: A max-preflow approach, Multiple objective minimum cost flow problems: a review, Using error bounds to compare aggregated generalized transportation models, \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows, A survey of dynamic network flows, The auction algorithm for the transportation problem, Parallel arc-allocation algorithms for optimizing generalized networks, Network reoptimization procedures for multiobjective network problems, Approximate solutions to large scale capacitated facility location problems, A surrogate and Lagrangian approach to constrained network problems, A comparison of solution strategies for biobjective shortest path problems, A two-phase algorithm for the biobjective integer minimum cost flow problem, Reoptimization procedures for bounded variable primal simplex network algorithms, Computational experience with a polynomial-time dual simplex algorithm for the transportation problem, Network generation using the Prufer code, Network flow problems with one side constraint: A comparison of three solution methods, The equal flow problem, Dual coordinate step methods for linear network flow problems, Implementation and analysis of a variant of the dual method for the capacitated transshipment problem, A classroom/time assignment model, On the budget-restricted max flow problem, A network penalty method, On the computational behavior of a polynomial-time network flow algorithm, Efficient solutions for the bicriteria network flow problem, Primal-dual proximal point algorithm for linearly constrained convex programming problems, On the dual coordinate ascent approach for nonlinear networks, Solving singularly constrained generalized network problems, The generalized alternating path algorithm for transportation problems, A robustness approach to uncapacitated network design problems, Algorithms for network piecewise-linear programs: A comparative study, Computational investigations of maximum flow algorithms, Iterative improvement methods for a multiperiod network design problem, Extensions of Dinkelbach's algorithm for solving nonlinear fractional programming problems, A generic auction algorithm for the minimum cost network flow problem, Parallel primal-dual methods for the minimum cost flow problem, The auction algorithm: A distributed relaxation method for the assignment problem, Parallel alternating direction multiplier decomposition of convex programs, The facets of the polyhedral set determined by the Gale-Hoffman inequalities, On the complexity of the dual method for maximum balanced flows, Computing maximum mean cuts, A generator and a simplex solver for network piecewise linear programs, Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations, Applying steepest-edge techniques to a network primal-dual algorithm, Efficient parallel algorithms for the minimum cost flow problem, Automatic decrease of the penalty parameter in exact penalty function methods, Network simplex algorithm for the general equal flow problem., Computational comparisons of dual conjugate gradient algorithms for strictly convex networks., The interactive analysis of the multicriteria shortest path problem by the reference point method., Solving bicriteria 0--1 knapsack problems using a labeling algorithm., The biobjective minimum cost flow problem, An algorithmic study of the maximum flow problem: A comparative statistical analysis, A tabu search heuristic procedure for the fixed charge transportation problem, Experimental evaluation of solution approaches for the \(K\)-route maximum flow problem, Polynomial auction algorithms for shortest paths, Probabilistic local search algorithms for concave cost transportation network problems, An optimality cut for mixed integer linear programs, Implementation and test of auction methods for solving generalized network flow problems with separable convex cost, Approximation of convex curves with application to the bicriterial minimum cost flow problem, A generalization of the scaling max-flow algorithm, A label-setting algorithm for finding a quickest path, Scenario analysis via bundle decomposition, An auction algorithm for the max-flow problem, Parallel asynchronous label-correcting methods for shortest paths, A parallel descent algorithm for convex programming, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms, Designing and reporting on computational experiments with heuristic methods, Parallel asynchronous algorithms for the \(K\) shortest paths problem, Application of the dual active set algorithm to quadratic network optimization, Proximal minimizations with \(D\)-functions and the massively parallel solution of linear network programs, GENGUB: A generator for linear programs with generalized upper bound constraints, Practical sequential bounds for approximating two-terminal reliability, A survey on the continuous nonlinear resource allocation problem, Algorithms for time-dependent bicriteria shortest path problems, Fuzzy programming with hyperbolic membership functions for multiobjective capacitated transportation problem., Convergent Lagrangian heuristics for nonlinear minimum cost network flows, COLE: a new heuristic approach for fixed charge problem computational results, The network simplex method on a multiprocessor, Solving Large Scale Generalized Networks, A unified framework for primal-dual methods in minimum cost network flow problems, A hybrid algorithm for solving convex separable network flow problems, A piecewise linear upper bound on the network recourse function, Primal transportation and transshipment algorithms, The quickest flow problem, An improved version of the out-of-kilter method and a comparative study of computer codes, The alternating basis algorithm for assignment problems, Testing of a large-scale network optimization program, Implementing Goldberg's max-flow-algorithm ? A computational investigation, An efficient lagrangean relaxation scheme for linear and integer equal flow problems