Solving embedded generalized network problems

DOI10.1016/0377-2217(85)90091-8zbMath0565.90038OpenAlexW1971504584MaRDI QIDQ1058978

Richard D. McBride

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90091-8

zbMATH Keywords

computational experienceadditional constraintsnetwork substructures

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (9)

Dynamic factorization in large-scale optimization ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ Unnamed Item ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ The simplex algorithm for multicommodity networks ⋮ Extending and solving a multiperiod congested network flow model ⋮ Solution of constrained generalized transportation problems using the pivot and probe algorithm ⋮ Future paths for integer programming and links to artificial intelligence

Cites Work

• Unnamed Item
• Partitioning procedures for solving mixed-variables programming problems
• Solving singularly constrained generalized network problems
• Solving Generalized Networks
• Decomposition Principle for Linear Programs
• Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
• A polynomially bounded algorithm for a singly constrained quadratic program
• The simplex SON algorithm for LP/embedded network problems
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• Solving Constrained Transportation Problems
• The factorization approach to large-scale linear programming
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
• Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
• Augmented Threaded Index Method For Network Optimization
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems

This page was built for publication: Solving embedded generalized network problems