NETGEN
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A two-phase algorithm for the biobjective integer minimum cost flow problem
- Finding non-dominated solutions in bi-objective integer network flow problems
- An XML-based schema for stochastic programs
- A primal-dual simplex algorithm for bi-objective network flow problems
- 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
- 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
- Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
- 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
- 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
- On the complexity of the dual method for maximum balanced flows
- Computing maximum mean cuts
- MPGENR
- Data-level parallel solution of min-cost network flow problems using \(\varepsilon\)-relaxations
- mpi-sppy
- 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.
- ACM/EATCS
- 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
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- KORBX
- The energy-constrained quickest path problem
- Concealment measurement and flow distribution of military supply transportation: a double-entropy model
- PPRN
- PDNET
- SMPS reader
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- MCF
- MCFClass
- RelaxIV
- An exact algorithm for a multicommodity min-cost flow over time problem
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- A network simplex method for the budget-constrained minimum cost 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
- 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
- ISAAP
- Parallel asynchronous algorithms for the K shortest paths problem
- New -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
- A polynomial local optimality condition for the concave piecewise linear network flow problem
- Generation techniques for linear programming instances with controllable properties
- RELAX4
- Capacity inverse minimum cost flow problem
- Solving the shortest path tour 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
- Algorithm robust for the bicriteria discrete optimization problem
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- A survey on the continuous nonlinear resource allocation problem
- Algorithms for time-dependent bicriteria shortest path problems
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- Xerces
- Hyper-sparsity in the revised simplex method and how to exploit it
- Shortest path problem with forbidden paths: the elementary version
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- A linear input dependence model for interdependent networks
- XMLSpy
- A bilevel model and solution algorithm for a freight tariff-setting problem
- A general heuristic for production planning problems
- On assessing robustness in transportation planning
- scientific article; zbMATH DE number 992799 (Why is no real title available?)
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Using mathematical programming heuristics in a multicriteria network flow context
- On a dual network exterior point simplex type algorithm and its computational behavior
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- A heuristic algorithm for a network problem with variable upper bounds
- Network repair crew scheduling and routing for emergency relief distribution problem
This page was built for software: NETGEN
