scientific article; zbMATH DE number 5257230

zbMATH Open1160.90597MaRDI QIDQ5453756FDOQ5453756

Authors: We Wang, Yifan Xu 

Publication date: 3 April 2008

Title of this publication is not available (Why is that?)

Recommendations

• A bounded dual (all-integer) integer programming algorithm with an objective cut
• scientific article; zbMATH DE number 3922373
• Integer programming duality in multiple objective programming
• A combination of linear approximation and Lagrangian dual with a simple cut for general separable integer programming problems
• Optima of dual integer linear programs
• On the existence of duality gaps for mixed integer programming
• Duality gap in interval linear programming
• An optimality cut for mixed integer linear programs
• Towards strong duality in integer programming
• scientific article; zbMATH DE number 2159271

zbMATH Keywords

Lagrangian relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Numerical methods involving duality (49M29)

Cited In (1)

• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function

This page was built for publication:

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