An integral transformation for integer programming problems
From MaRDI portal
Recommendations
- On an integral transformation for integer programming
- The integral basis method for integer programming
- Integer programming as a framework for optimization and approximability
- Transformation of integer programs to knapsack problems
- The discrete Ψ -transformation method in integer programming
- scientific article; zbMATH DE number 781263
- An approach to the solution of integer optimization problems
- scientific article; zbMATH DE number 4143777
- The integrality number of an integer program
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3355098 (Why is no real title available?)
- A Polynomial Algorithm for the Two-Variable Integer Programming Problem
- A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables
- Integer Programming with a Fixed Number of Variables
Cited in
(7)- scientific article; zbMATH DE number 3878241 (Why is no real title available?)
- Transformations and consecutivities on a king for computational applications
- Transformation of a multi-choice linear programming problem
- The Integrality Number of an Integer Program
- scientific article; zbMATH DE number 4143777 (Why is no real title available?)
- On an integral transformation for integer programming
- A duality property for the set of all feasible solutions to an integer program
This page was built for publication: An integral transformation for integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1062628)
