A method for decomposing mixed-integer linear programming problems with angular structure
From MaRDI portal
Publication:3917899
DOI10.1080/00207728108963802zbMATH Open0465.90070OpenAlexW1996268882MaRDI QIDQ3917899FDOQ3917899
Authors: Nobuo Sannomiya, Masayuki Tsukabe
Publication date: 1981
Published in: International Journal of Systems Science. Principles and Applications of Systems and Integration (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207728108963802
algorithmmixed-integer linear programmingdecomposition procedurecoupling constraintangular structure
Cites Work
- Decomposition Principle for Linear Programs
- A Method of Decomposition for Integer Programs
- Title not available (Why is that?)
- Decomposition of systems governed by Markov chains
- Multistage linear programming for discrete optimal control with distributed-lags
- Dynamic Linear Programs for Production Scheduling
Cited In (4)
This page was built for publication: A method for decomposing mixed-integer linear programming problems with angular structure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917899)