Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»

DOI10.1007/BF02888417zbMath0692.90071MaRDI QIDQ3035139

No author found.

Publication date: 1990

Published in: Trabajos de Investigacion Operativa (Search for Journal in Brave)

zbMATH Keywords

upper boundsheuristicsLagrangean relaxationlower boundscutting planeset partitioningdesign of hybrid algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• Cutting planes from conditional bounds: A new approach to set covering
• Calculating surrogate constraints
• Surrogate Constraint Duality in Mathematical Programming
• A Convergent Duality Theory for Integer Programming
• An Improved Implicit Enumeration Approach for Integer Programming
• The Set-Partitioning Problem: Set Covering with Equality Constraints

This page was built for publication: Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»