Duality in {MIP} by branch-and-cut: generating dual price functions using branch-and-cut

zbMATH Open1161.90447MaRDI QIDQ3539486FDOQ3539486

Authors: Elena V. Pachkova 

Publication date: 18 November 2008

Full work available at URL: http://www.ici.ro/camo/journal/v7n2.htm

Recommendations

• scientific article; zbMATH DE number 2223038
• A dual heuristic for mixed integer programming
• scientific article; zbMATH DE number 1094754
• Duality for mixed-integer linear programs
• Solving a mixed integer program by fathoming dual programs

Mathematics Subject Classification ID

Optimality conditions and duality in mathematical programming (90C46) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Mixed integer programming (90C11)

This page was built for publication: Duality in {MIP} by branch-and-cut: generating dual price functions using branch-and-cut

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