scientific article; zbMATH DE number 3968330

MaRDI QIDQ3735467zbMATH OpenFDO

Authors Ruy Eduardo Campello

Publication date 1985

zbMATH Keywords

Computational resultsheuristic algorithmimplicit enumeration algorithmprimal cutting plane algorithmset partitioning

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09)

Recommendations

• Heuristics, cutting planes and subgradient optimization for set partitioning problems
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
• A network relaxation based enumeration algorithm for set partitioning

Cited in

(10)

• Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
• A network relaxation based enumeration algorithm for set partitioning
• A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
• Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
• scientific article; zbMATH DE number 3878935 (Why is no real title available?)
• Particle swarm optimization algorithm for the set partition problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Heuristics, cutting planes and subgradient optimization for set partitioning problems
• Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
• A hybrid exact algorithm for complete set partitioning

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