scientific article; zbMATH DE number 5173819

MaRDI QIDQ5294045zbMATH OpenFDO

Authors Abilio Lucena

Publication date 23 July 2007

zbMATH Keywords

cutting planesknapsack problemLagrangian relaxationrelax-and-cut

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Efficient cuts in Lagrangean `relax-and-cut' schemes
• Lagrangian Relaxation and Cutting Planes for the Vertex Separator Problem
• scientific article; zbMATH DE number 4197745
• Lagrangian relaxation for integer programming
• scientific article; zbMATH DE number 1182577
• scientific article; zbMATH DE number 2084780
• scientific article; zbMATH DE number 3614502
• A lagrangean relaxation algorithm for the constrained matrix problem
• Lagrangean relaxation-based algorithm for bi-level problems

Cited in

(11)

• Efficient cuts in Lagrangean `relax-and-cut' schemes
• A relax-and-cut framework for large-scale maximum weight connected subgraph problems
• A relax-and-cut framework for Gomory mixed-integer cuts
• Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
• Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes
• A relax-and-cut algorithm for the set partitioning problem
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
• A Lagrangian Relaxation for Golomb Rulers
• Principles and Practice of Constraint Programming – CP 2004
• Lagrangian heuristics for the quadratic knapsack problem
• Non delayed relax-and-cut algorithms

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 Q5294045)