Algorithms for solving a separable problem of discrete optimization

DOI10.1016/0041-5553(90)90069-5MaRDI QIDQ4713238zbMATH OpenOpenAlexFDO

Authors S. Sergeev

Publication date 25 June 1992

Published in USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0041-5553(90)90069-5

zbMATH Keywords

nonlinear separable integer programming

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Integer programming (90C10) Nonlinear programming (90C30) Discrete-time control/observation systems (93C55) Application models in control theory (93C95)

Recommendations

• scientific article; zbMATH DE number 4167852
• Algorithm unions for solving discrete optimization problems
• An algorithm for separable nonlinear minimax problems
• An Algorithm for Separable Nonconvex Programming Problems
• scientific article; zbMATH DE number 3885230
• scientific article; zbMATH DE number 3976782
• scientific article; zbMATH DE number 193499
• scientific article; zbMATH DE number 2090687
• Discrete optimization
• A problem reduction based approach to discrete optimization algorithm design

Cited in

(6)

• A bound-improving approach to discrete programming problems
• A discrete EOQ problem is solvable in \(O(\log n)\) time
• scientific article; zbMATH DE number 5898062 (Why is no real title available?)
• APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems
• OPTi's Algorithm for Discreteness Determination
• scientific article; zbMATH DE number 519872 (Why is no real title available?)

This page was built for publication: Algorithms for solving a separable problem of discrete optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713238)