Cited in
(only showing first 100 items - show all)- On the complexity of the dual method for maximum balanced flows
- Shortest path problem with forbidden paths: the elementary version
- scientific article; zbMATH DE number 679861 (Why is no real title available?)
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- Network generation using the Prufer code
- Primal-dual proximal point algorithm for linearly constrained convex programming problems
- scientific article; zbMATH DE number 992799 (Why is no real title available?)
- Probabilistic local search algorithms for concave cost transportation network problems
- On the shortest path problem with negative cost cycles
- Approximation of convex curves with application to the bicriterial minimum cost flow problem
- New \(\epsilon\)-constraint methods for multi-objective integer linear programming: a Pareto front representation approach
- 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
- Applying steepest-edge techniques to a network primal-dual algorithm
- Modeling the satellite placement problem as a network flow problem with one side constraint
- Solving the shortest path tour problem
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- Use of Representative Operation Counts in Computational Testing of Algorithms
- A simple GAP-canceling algorithm for the generalized maximum flow problem
- A proximal subgradient projection algorithm for linearly constrained strictly convex problems
- A More Portable Fortran Random Number Generator
- On the budget-restricted max flow problem
- Computational comparisons of dual conjugate gradient algorithms for strictly convex networks.
- A hybrid algorithm for solving convex separable network flow problems
- Synchronous and asynchronous implementations of relaxation algorithms for nonlinear network optimization
- scientific article; zbMATH DE number 1759394 (Why is no real title available?)
- Network flow problems with one side constraint: A comparison of three solution methods
- Using mathematical programming heuristics in a multicriteria network flow context
- 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
- Approximate solutions to large scale capacitated facility location problems
- The energy-constrained quickest path problem
- Dual coordinate step methods for linear network flow problems
- A Cross Decomposition Algorithm for Capacitated Facility Location
- scientific article; zbMATH DE number 3659278 (Why is no real title available?)
- Algorithms for network piecewise-linear programs: A comparative study
- A specialized network simplex algorithm for the constrained maximum flow problem
- Parallel asynchronous label-correcting methods for shortest paths
- DECOMPOSITION ALGORITHMS TO COMPUTE THE QUICKEST TIME DISTRIBUTION IN DYNAMIC NETWORKS
- The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation
- PARALLELIZATION STRATEGIES OF A ROW-ACTION METHOD FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
- A network penalty method
- A general heuristic for production planning problems
- Dealing with residual energy when transmitting data in energy-constrained capacitated networks
- An XML-based schema for stochastic programs
- Efficient solutions for the bicriteria network flow problem
- A robustness approach to uncapacitated network design problems
- Using error bounds to compare aggregated generalized transportation models
- A network simplex method for the budget-constrained minimum cost flow problem
- Algorithms for the quickest path problem and the reliable quickest path problem
- An algorithm for the biobjective integer minimum cost flow problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- On a dual network exterior point simplex type algorithm and its computational behavior
- Solving the nearly symmetric all-pairs shortest-path problem
- Algorithm robust for the bicriteria discrete optimization problem
- Polynomial auction algorithms for shortest paths
- A Flow Augmentation Approach to the Network with Gains Minimum Cost Flow Problem
- Efficient computational devices for the capacitated transportation problem
- A generalization of the scaling max-flow algorithm
- scientific article; zbMATH DE number 5007543 (Why is no real title available?)
- A parallel descent algorithm for convex programming
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear 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
- Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
- An ant colony optimization metaheuristic for single-path multicommodity network flow problems
- The maximum flow problem: A max-preflow approach
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- GENGUB: A generator for linear programs with generalized upper bound constraints
- Network simplex algorithm for the general equal flow problem.
- On assessing robustness in transportation planning
- A classroom/time assignment model
- A polynomial local optimality condition for the concave piecewise linear network flow problem
- Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points
- Dual Algorithms for Pure Network Problems
- MPGENR
- ACM/EATCS
- KORBX
- PPRN
- PDNET
- SMPS reader
- MCF
- MCFClass
- RelaxIV
- ISAAP
- RELAX4
- Xerces
- XMLSpy
- ddsip
- Algorithm 97
- MOIP_AIRA
- XMP
- Network repair crew scheduling and routing for emergency relief distribution problem
- A Class of Label-Correcting Methods for the K Shortest Paths Problem
- An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
- Bounded-degree spanning tree problems: models and new algorithms
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
This page was built for software: NETGEN
