Solution and investigation of one class of inexact integer programming problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3715310 (Why is no real title available?)
- scientific article; zbMATH DE number 3761783 (Why is no real title available?)
- Technical Note—A Duality Theory for Convex Programming with Set-Inclusive Constraints
Cited in
(10)- Investigation of solutions of randomly generated integer programming problems with 0-1 variables
- Integer programming problems with inexact data: Exact and approximate solutions
- Interval discrete programming
- Bilevel optimization problems of distribution of interbudgetary transfers under given limitations
- Methods of searching for guaranteeing and optimistic solutions to integer optimization problems under uncertainty
- A decomposition approach to the solution of some integer programming problems with inexact data
- scientific article; zbMATH DE number 4156196 (Why is no real title available?)
- scientific article; zbMATH DE number 4087425 (Why is no real title available?)
- On a finding the guaranteed with respect to the cost function solution in the integer programming problem
- An approach to solving discrete vector optimization problems over a combinatorial set of permutations
This page was built for publication: Solution and investigation of one class of inexact integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4005344)
