Lagrangian dual for integer optimization with zero duality gap that admits decomposition

DOI10.1007/978-3-031-93112-3_14MaRDI QIDQ6880138zbMATH OpenFDO

Authors Diego Cifuentes, Santanu S. Dey, Jingye Xu

Publication date 22 December 2025

Full work available at URL https://doi.org/10.1007/978-3-031-93112-3_14

zbMATH Keywords

distributed computingLagrangian dualstrong duality

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites work

• A geometric study of dual gaps, with applications
• A scenario decomposition algorithm for 0-1 stochastic programs
• Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
• Automatic Dantzig-Wolfe reformulation of mixed integer programs
• Combining progressive hedging with a Frank-Wolfe method to compute Lagrangian dual bounds in stochastic mixed-integer programming
• Decomposition methods for global solution of mixed-integer linear programs
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips
• Exact augmented Lagrangian duality for mixed integer linear programming
• Exact augmented Lagrangian duality for mixed integer quadratic programming
• Finitely convergent decomposition algorithms for two-stage stochastic pure integer programs
• Forbidden vertices
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Improving the integer L-shaped method
• Incidence matrices and interval graphs
• Introduction to nonsmooth optimization. Theory, practice and software
• Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
• LP formulations for polynomial optimization problems
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• On non-serial dynamic programming
• On sample average approximation for two-stage stochastic programs without relatively complete recourse
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Sensitivity analysis for mixed binary quadratic programming
• Stochastic Convex Programming: Relatively Complete Recourse and Induced Feasibility
• Sums of squares, moment matrices and optimization over polynomials
• The integer \(L\)-shaped method for stochastic integer programs with complete recourse

This page was built for publication: Lagrangian dual for integer optimization with zero duality gap that admits decomposition

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