NETGEN

swMATH9229MaRDI QIDQ21219FDOQ21219

Author name not available (Why is that?)

Official website: http://pubsonline.informs.org/doi/abs/10.1287/mnsc.20.5.814

Described by source

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

Cited In (only showing first 100 items - show all)

• On the complexity of the dual method for maximum balanced flows
• Network generation using the Prufer code
• Title not available (Why is that?)
• Primal-dual proximal point algorithm for linearly constrained convex programming problems
• Applying steepest-edge techniques to a network primal-dual algorithm
• Use of Representative Operation Counts in Computational Testing of Algorithms
• On the budget-restricted max flow problem
• Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
• Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
• Approximate solutions to large scale capacitated facility location problems
• The energy-constrained quickest path problem
• Algorithms for network piecewise-linear programs: A comparative study
• Parallel asynchronous label-correcting methods for shortest paths
• A network penalty method
• Efficient solutions for the bicriteria network flow problem
• Using error bounds to compare aggregated generalized transportation models
• A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem
• Title not available (Why is that?)
• A parallel descent algorithm for convex programming
• An improved version of the out-of-kilter method and a comparative study of computer codes
• Real World Applications of Network Related Problems and Breakthroughs in Solving Them Efficiently
• Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code
• An ant colony optimization metaheuristic for single-path multicommodity network flow problems
• Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
• On assessing robustness in transportation planning
• Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
• A Class of Label-Correcting Methods for the K Shortest Paths Problem
• Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
• Primal transportation and transshipment algorithms
• Parallel primal-dual methods for the minimum cost flow 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
• A heuristic algorithm for a network problem with variable upper bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• A generic auction algorithm for the minimum cost network flow problem
• Solving singularly constrained generalized network problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A unified framework for primal-dual methods in minimum cost network flow problems
• A surrogate and Lagrangian approach to constrained network problems
• Investing in arcs in a network to maximize the expected max flow
• mpi-sppy
• Title not available (Why is that?)
• A comparison of pivot selection rules for primal simplex based network codes
• On the dual coordinate ascent approach for nonlinear networks
• Algorithms – ESA 2005
• Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
• Simplicial Decomposition for Convex Generalized Networks
• The generalized alternating path algorithm for transportation problems
• Efficient parallel algorithms for the minimum cost flow problem
• An auction algorithm for the max-flow problem
• An exact algorithm for a multicommodity min-cost flow over time problem
• On the shortest path problem with negative cost cycles
• DSPopt.jl
• aircond
• An algorithmic study of the maximum flow problem: A comparative statistical analysis
• New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
• A simple GAP-canceling algorithm for the generalized maximum flow problem
• A proximal subgradient projection algorithm for linearly constrained strictly convex problems
• A hybrid algorithm for solving convex separable network flow problems
• Title not available (Why is that?)
• PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
• The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
• Dealing with residual energy when transmitting data in energy-constrained capacitated networks
• Efficient computational devices for the capacitated transportation problem
• A generalization of the scaling max-flow algorithm
• GENGUB: A generator for linear programs with generalized upper bound constraints
• A polynomial local optimality condition for the concave piecewise linear network flow problem
• A linear input dependence model for interdependent networks
• Generation techniques for linear programming instances with controllable properties
• Concealment measurement and flow distribution of military supply transportation: a double-entropy model
• Implementation and test of auction methods for solving generalized network flow problems with separable convex cost
• Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets
• Graph collapsing in shortest path auction algorithms
• Parallel asynchronous algorithms for the \(K\) shortest paths problem
• Title not available (Why is that?)
• Shortest path problem with forbidden paths: the elementary version
• Probabilistic local search algorithms for concave cost transportation network problems
• Approximation of convex curves with application to the bicriterial minimum cost flow problem
• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• A piecewise linear upper bound on the network recourse function
• A bilevel model and solution algorithm for a freight tariff-setting problem
• Solving the shortest path tour problem
• Modeling the satellite placement problem as a network flow problem with one side constraint
• A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
• A More Portable Fortran Random Number Generator
• Using mathematical programming heuristics in a multicriteria network flow context
• Network flow problems with one side constraint: A comparison of three solution methods
• An optimality cut for mixed integer linear programs
• Stochastic and dynamic shipper carrier network design problem
• A Benders decomposition algorithm for the maximum availability service facility location problem
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Title not available (Why is that?)
• DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
• Dual coordinate step methods for linear network flow problems

This page was built for software: NETGEN