swMATH9229MaRDI QIDQ21219FDOQ21219
Author name not available (Why is that?)
Official website: http://pubsonline.informs.org/doi/abs/10.1287/mnsc.20.5.814
Cited In (only showing first 100 items - show all)
- 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
- A specialized network simplex algorithm for the constrained maximum flow problem
- A general heuristic for production planning problems
- A network penalty method
- An XML-based schema for stochastic programs
- A robustness approach to uncapacitated network design problems
- An algorithm for the biobjective integer minimum cost flow problem
- A network simplex method for the budget-constrained minimum cost flow problem
- On a dual network exterior point simplex type algorithm and its computational behavior
- Solving the nearly symmetric all-pairs shortest-path problem
- Algorithms for the quickest path problem and the reliable quickest path problem
- A tabu search heuristic procedure for the fixed charge transportation problem
- Algorithm robust for the bicriteria discrete optimization problem
- Polynomial auction algorithms for shortest paths
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
- The maximum flow problem: A max-preflow approach
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem
- Network simplex algorithm for the general equal flow problem.
- A classroom/time assignment model
- Dual Algorithms for Pure Network Problems
- An Advanced Dual Basic Feasible Solution for a Class of Capacitated Generalized Networks
- Network repair crew scheduling and routing for emergency relief distribution problem
- Bounded-degree spanning tree problems: models and new algorithms
- The biobjective undirected two-commodity minimum cost flow problem
- Computational investigations of maximum flow algorithms
- ACM/EATCS
- KORBX
- PPRN
- PDNET
- SMPS reader
- MCF
- MCFClass
- RelaxIV
- ISAAP
- RELAX4
- Xerces
- XMLSpy
- SearchCol
- Multiple objective minimum cost flow problems: a review
- Title not available (Why is that?)
- The auction algorithm for the transportation problem
- A two-phase algorithm for the biobjective integer minimum cost flow problem
- ddsip
- Algorithm 97
- MOIP_AIRA
- Finding non-dominated solutions in bi-objective integer network flow problems
- A primal-dual simplex algorithm for bi-objective network flow problems
- Relaxation Methods for Network Flow Problems with Convex Arc Costs
- Label correcting methods to solve multicriteria shortest path problems
- A survey on the continuous nonlinear resource allocation problem
- XMP
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- A label-setting algorithm for finding a quickest path
- A model-based approach and analysis for multi-period networks
- The biobjective minimum cost flow problem
- A survey of dynamic network flows
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Automatic decrease of the penalty parameter in exact penalty function methods
- A least-squares minimum-cost network flow algorithm
- Practical sequential bounds for approximating two-terminal reliability
- The alternating basis algorithm for assignment problems
- Algorithms for time-dependent bicriteria shortest path problems
- Hyper-sparsity in the revised simplex method and how to exploit it
- The interactive analysis of the multicriteria shortest path problem by the reference point method.
- Designing and reporting on computational experiments with heuristic methods
- Capacity inverse minimum cost flow problem
- Reoptimization procedures for bounded variable primal simplex network algorithms
- Solving Mixed Integer Programming Problems Using Automatic Reformulation
- An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
- Pivot Strategies for Primal-Simplex Network Codes
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- Computing maximum mean cuts
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- The auction algorithm: A distributed relaxation method for the assignment problem
- 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
This page was built for software: NETGEN
