Dynamic factorization in large-scale optimization
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3852820
- Numerical Factorization Methods for Interior Point Algorithms
- scientific article; zbMATH DE number 3858846
- scientific article; zbMATH DE number 3852786
- Decomposed block Cholesky factorization in the Karmarkar algorithm. Solving a class of super large LP problems
Cites work
- scientific article; zbMATH DE number 3876888 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 3520148 (Why is no real title available?)
- scientific article; zbMATH DE number 3538745 (Why is no real title available?)
- scientific article; zbMATH DE number 3561082 (Why is no real title available?)
- scientific article; zbMATH DE number 3561083 (Why is no real title available?)
- scientific article; zbMATH DE number 3892457 (Why is no real title available?)
- scientific article; zbMATH DE number 3354805 (Why is no real title available?)
- A Primal Simplex Approach to Pure Processing Networks
- A Survey of Linear Cost Multicommodity Network Flows
- A bump triangular dynamic factorization algorithm for the simplex method
- A complete constructive algorithm for the general mixed linear programming problem
- A generalized upper bounding algorithm for multicommodity network flow problems
- A generalized upper bounding method for doubly coupled linear programs
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- A product form representation of the inverse of a multicommodity cycle matrix
- A streamlined simplex approach to the singly constrained transportation problem
- Analysis of mathematical programming problems prior to applying the simplex algorithm
- Automatic Identification of Generalized Upper Bounds in Large-Scale Optimization Models
- Automatic identification of embedded network rows in large-scale optimization models
- Decomposition Principle for Linear Programs
- Determining GUB sets via an invert agenda algorithm
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment Algorithms
- Extracting embedded generalized networks from linear programming problems
- Finding Embedded Network Rows in Linear Programs I. Extraction Heuristics
- Generalized upper bounding techniques
- Identification of special structure constraints in linear programs
- Implicit representation of generalized variable upper bounds in linear programming
- Large-scale linear programming: Geometry, working bases and factorizations
- Multicommodity Distribution System Design by Benders Decomposition
- Multicommodity network flows—A survey
- Partitioning procedures for solving mixed-variables programming problems
- Primal partition programming for block diagonal matrices
- Reinversion with the preassigned pivot procedure
- Solving Constrained Transportation Problems
- Solving Generalized Networks
- Solving embedded generalized network problems
- Solving multicommodity transportation problems using a primal partitioning simplex technique
- Solving singularly constrained generalized network problems
- The factorization approach to large-scale linear programming
- The simplex SON algorithm for LP/embedded network problems
Cited in
(7)- A specialized network simplex algorithm for the constrained maximum flow problem
- Strategic production-distribution models: A critical review with emphasis on global supply chain models
- A strategic model for supply chain design with logical constraints: Formulation and solution.
- Feature-based methods for large scale dynamic programming
- scientific article; zbMATH DE number 3858846 (Why is no real title available?)
- Valid integer polytope (VIP) penalties for branch-and-bound enumeration
- Optimizing ship berthing
This page was built for publication: Dynamic factorization in large-scale optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330893)
