Identification of special structure constraints in linear programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3668320 (Why is no real title available?)
- scientific article; zbMATH DE number 3561083 (Why is no real title available?)
- Decomposition Principle for Linear Programs
- Determining GUB sets via an invert agenda algorithm
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Implicit representation of generalized variable upper bounds in linear programming
- Optimization of the flow through networks with gains
- Rearranging Matrices to Block-Angular form for Decomposition (And Other) Algorithms
- Reinversion with the preassigned pivot procedure
- The Solution of Leontief Substitution Systems using Matrix Iterative Techniques
Cited in
(7)- Detecting embedded pure network structures in LP problems
- Use of hidden network structure in the set partitioning problem
- Dynamic factorization in large-scale optimization
- The practical conversion of linear programmes to network flow models
- Dynamic versions of set covering type public facility location problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- Variations and extensions of Proll's integer linear programming formulation techniques for the graph partitioning problem
This page was built for publication: Identification of special structure constraints in linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3920989)
