A method for decomposing mixed-integer linear programming problems with angular structure

DOI10.1080/00207728108963802MaRDI QIDQ3917899zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

algorithmmixed-integer linear programmingdecomposition procedurecoupling constraintangular structure

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11)

Cites work

• scientific article; zbMATH DE number 3356467 (Why is no real title available?)
• A Method of Decomposition for Integer Programs
• Decomposition Principle for Linear Programs
• Decomposition of systems governed by Markov chains
• Dynamic Linear Programs for Production Scheduling
• Multistage linear programming for discrete optimal control with distributed-lags

Cited in

(4)

• Optimal control of system with continuous and discrete state variables
• Decentralization model with flexible multi-goals and concessions
• A method for decomposing mixed-integer linear programs with staircase structure
• A heuristic decomposition approach to optimal control in a water supply model

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)