A result in surrogate duality for certain integer programming problems
From MaRDI portal
Recommendations
Cites work
- Aggregating diophantine equations
- Aggregation of constraints in integer programming
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
- Technical Note—Solving Integer Programming Problems by Aggregating Constraints
- Transformation of integer programs to knapsack problems
Cited in
(10)- On the existence of duality gaps for mixed integer programming
- On zero duality gap in surrogate constraint optimization: the case of rational-valued functions of constraints
- Exact algorithm for the surrogate dual of an integer programming problem: Subgradient method approach
- scientific article; zbMATH DE number 4039640 (Why is no real title available?)
- An aggregate function method for integer programming
- On generalized surrogate duality in mixed-integer nonlinear programming
- How effective is aggregation for solving 0-1 models?
- Optimal constraints aggregation method for ILP
- Zero duality gap in integer programming: \(P\)-norm surrogate constraint method
- Aggregation of constraints in integer programming
This page was built for publication: A result in surrogate duality for certain integer programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1122485)
