Implicit representation of generalized variable upper bounds in linear programming
From MaRDI portal
Cited in
(19)- Large-scale linear programming: Geometry, working bases and factorizations
- An Implementation of Variable Upper Bounds via SUB Methodology
- Detecting embedded pure network structures in LP problems
- Solution techniques for some allocation problems
- Dynamic factorization in large-scale optimization
- Identification of special structure constraints in linear programs
- Implicit representation of generalized variable upper bounds using the elimination form of the inverse on secondary storage
- Dual simplex algorithm with implicit representation of variable upper bounds
- A note on Schrage's generalised variable upper bounds
- Linear programming by nested decomposition : the primal decomplex method
- A dual approach for the continuous collapsing knapsack problem
- Compact LP bases for a class of IP problems
- An implementation of the simplex method for linear programming problems with variable upper bounds
- Locational analysis
- An algorithm finding p-medians of a graph
- Models for multimode multicommodity location problems with interdepot balancing requirements
- Exploiting special structure in Karmarkar's linear programming algorithm
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
- Bounded isotonic median regression
This page was built for publication: Implicit representation of generalized variable upper bounds in linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4162962)
