NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
From MaRDI portal
Publication:4058479
DOI10.1287/MNSC.20.5.814zbMath0303.90042OpenAlexW2033982221MaRDI 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
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05)
Related Items (only showing first 100 items - show all)
A hybrid algorithm for solving convex separable network flow problems ⋮ 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 ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ The network simplex method on a multiprocessor ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Minimum-cost flow algorithms: an experimental evaluation ⋮ Minimum cost noncrossing flow problem on layered networks ⋮ A linear input dependence model for interdependent networks ⋮ A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty ⋮ Minimum cost flow problem with conflicts ⋮ An integer programming column generation principle for heuristic search methods ⋮ The quickest flow problem ⋮ An extreme‐point tabu‐search algorithm for fixed‐charge network problems ⋮ A piecewise linear upper bound on the network recourse function ⋮ Robust flows with adaptive mitigation ⋮ Mean‐standard deviation model for minimum cost flow problem ⋮ The inverse \(\{0,1\}\)-knapsack problem: theory, algorithms and computational experiments ⋮ An improved version of the out-of-kilter method and a comparative study of computer codes ⋮ An algorithm to solve the proportional network flow problem ⋮ An edge-swap heuristic for generating spanning trees with minimum number of branch vertices ⋮ Generation techniques for linear programming instances with controllable properties ⋮ Parallel asynchronous algorithms for the \(K\) shortest paths problem ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ An enhanced exact procedure for the absolute robust shortest path problem ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ Fuzzy programming with hyperbolic membership functions for multiobjective capacitated transportation problem. ⋮ An algorithm for the biobjective integer minimum cost flow problem ⋮ Convergent Lagrangian heuristics for nonlinear minimum cost network flows ⋮ Capacity inverse minimum cost flow problem ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ Primal transportation and transshipment algorithms ⋮ The alternating basis algorithm for assignment problems ⋮ Label correcting methods to solve multicriteria shortest path problems ⋮ On the shortest path problem with negative cost cycles ⋮ Testing of a large-scale network optimization program ⋮ A compaction scheme and generator for distribution networks ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem ⋮ Implementing Goldberg's max-flow-algorithm ? A computational investigation ⋮ COLE: a new heuristic approach for fixed charge problem computational results ⋮ An efficient lagrangean relaxation scheme for linear and integer equal flow problems ⋮ Solving Large Scale Generalized Networks ⋮ A unified framework for primal-dual methods in minimum cost network flow problems ⋮ New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach ⋮ A Benders decomposition algorithm for the maximum availability service facility location problem ⋮ Solving the shortest path tour problem ⋮ Computing maximum mean cuts ⋮ A generator and a simplex solver for network piecewise linear programs ⋮ A generalization of the scaling max-flow algorithm ⋮ Network generation using the Prufer code ⋮ A label-setting algorithm for finding a quickest path ⋮ The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation ⋮ Fast and fine quickest path algorithm ⋮ ILP formulation of the degree-constrained minimum spanning hierarchy problem ⋮ Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations ⋮ Stochastic and dynamic shipper carrier network design problem ⋮ Scenario analysis via bundle decomposition ⋮ A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem ⋮ Network repair crew scheduling and routing for emergency relief distribution problem ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ Multiple objective minimum cost flow problems: a review ⋮ On finding representative non-dominated points for bi-objective integer network flow problems ⋮ A simulated annealing for multi-criteria network path problems ⋮ The equal flow problem ⋮ Applying steepest-edge techniques to a network primal-dual algorithm ⋮ An auction algorithm for the max-flow problem ⋮ Parallel asynchronous label-correcting methods for shortest paths ⋮ A parallel descent algorithm for convex programming ⋮ Using error bounds to compare aggregated generalized transportation models ⋮ A model-based approach and analysis for multi-period networks ⋮ Dual coordinate step methods for linear network flow problems ⋮ An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem ⋮ A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms ⋮ Algorithms for the quickest path problem and the reliable quickest path problem ⋮ Efficient parallel algorithms for the minimum cost flow problem ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ The energy-constrained quickest path problem ⋮ Column generation algorithms for nonlinear optimization. II: Numerical investigations ⋮ Concealment measurement and flow distribution of military supply transportation: a double-entropy model ⋮ Automatic decrease of the penalty parameter in exact penalty function methods ⋮ Implementation and analysis of a variant of the dual method for the capacitated transshipment problem ⋮ Identifying preferred solutions to multi-objective binary optimisation problems, with an application to the multi-objective knapsack problem ⋮ 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. ⋮ Bounded-degree spanning tree problems: models and new algorithms ⋮ Simulated annealing based GRASP for Pareto-optimal dissimilar paths problem ⋮ \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows ⋮ Solving bicriteria 0--1 knapsack problems using a labeling algorithm. ⋮ A classroom/time assignment model ⋮ On the budget-restricted max flow problem
This page was built for publication: NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
