NETGEN
From MaRDI portal
Software:21219
No author found.
Related Items (only showing first 100 items - show all)
Unnamed Item ⋮ A hybrid algorithm for solving convex separable network flow problems ⋮ On a dual network exterior point simplex type algorithm and its computational behavior ⋮ DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS ⋮ A Cross Decomposition Algorithm for Capacitated Facility Location ⋮ PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS ⋮ Unnamed Item ⋮ A heuristic algorithm for a network problem with variable upper bounds ⋮ Unnamed Item ⋮ Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets ⋮ Unnamed Item ⋮ A piecewise linear upper bound on the network recourse function ⋮ Efficient computational devices for the capacitated transportation problem ⋮ Unnamed Item ⋮ Relaxation Methods for Network Flow Problems with Convex Arc Costs ⋮ Investing in arcs in a network to maximize the expected max flow ⋮ 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 ⋮ Use of Representative Operation Counts in Computational Testing of Algorithms ⋮ Dual Algorithms for Pure Network Problems ⋮ Unnamed Item ⋮ Implementation and Computational Study on an In-Core, Out-of-Core Primal Network Code ⋮ A simple GAP-canceling algorithm for the generalized maximum flow problem ⋮ An algorithm for the biobjective integer minimum cost flow problem ⋮ Unnamed Item ⋮ A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem ⋮ Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming ⋮ Development of a Parametric Generating Procedure for Integer Programming Test Problems ⋮ An ant colony optimization metaheuristic for single-path multicommodity network flow problems ⋮ An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks ⋮ Graph collapsing in shortest path auction algorithms ⋮ A proximal subgradient projection algorithm for linearly constrained strictly convex problems ⋮ Primal transportation and transshipment algorithms ⋮ Unnamed Item ⋮ Pivot Strategies for Primal-Simplex Network Codes ⋮ 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 ⋮ Unnamed Item ⋮ Simplicial Decomposition for Convex Generalized Networks ⋮ Solving the Nearly Symmetric All-Pairs Shortest-Path Problem ⋮ A Class of Label-Correcting Methods for the K Shortest Paths Problem ⋮ A More Portable Fortran Random Number Generator ⋮ Algorithms – ESA 2005 ⋮ A New Optimization Method for Large Scale Fixed Charge Transportation Problems ⋮ Solving Mixed Integer Programming Problems Using Automatic Reformulation ⋮ Unnamed Item ⋮ Implementing Goldberg's max-flow-algorithm ? A computational investigation ⋮ Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A unified framework for primal-dual methods in minimum cost network flow problems ⋮ Computing maximum mean cuts ⋮ Using mathematical programming heuristics in a multicriteria network flow context ⋮ A General Heuristic for Production Planning 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 ⋮ 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 ⋮ Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations ⋮ Stochastic and dynamic shipper carrier network design problem ⋮ Practical sequential bounds for approximating two-terminal reliability ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ A polynomial local optimality condition for the concave piecewise linear network flow problem ⋮ 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 ⋮ 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 ⋮ 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 ⋮ Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points ⋮ Designing and reporting on computational experiments with heuristic methods ⋮ The energy-constrained quickest path problem ⋮ Concealment measurement and flow distribution of military supply transportation: a double-entropy model ⋮ Automatic decrease of the penalty parameter in exact penalty function methods ⋮ A linear input dependence model for interdependent networks ⋮ Implementation and analysis of a variant of the dual method for the capacitated transshipment 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 ⋮ A classroom/time assignment model ⋮ On the budget-restricted max flow problem ⋮ A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration ⋮ A survey of dynamic network flows ⋮ A least-squares minimum-cost network flow algorithm ⋮ The auction algorithm for the transportation problem ⋮ Approximate solutions to large scale capacitated facility location problems ⋮ A surrogate and Lagrangian approach to constrained network problems
This page was built for software: NETGEN
