Heuristics, cutting planes and subgradient optimization for set partitioning problems

MaRDI QIDQ5323365zbMATH OpenFDO

Authors

Publication date 23 July 2009

Full work available at URL https://eudml.org/doc/40138, http://www.idescat.cat/sort/questiio/questiiopdf/12.2.5.barcelo.pdf

zbMATH Keywords

cutting planesprimal and dual heuristicsset partitioningsubgradient optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3968330
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• On some difficult linear programs coming from set partitioning

Cited in

(9)

• A concurrent processing framework for the set partitioning problem
• A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
• A new modeling and solution approach for the set-partitioning problem
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
• scientific article; zbMATH DE number 3856823 (Why is no real title available?)
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• scientific article; zbMATH DE number 3968330 (Why is no real title available?)
• Worst case analysis of two heuristics for the set partitioning problem
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem

This page was built for publication: Heuristics, cutting planes and subgradient optimization for set partitioning problems

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