Set partitioning mit linearen Randbedingungen

DOI10.1007/BF01719072zbMath0443.90065OpenAlexW1973385928MaRDI QIDQ1144493

Martin Rohde

Publication date: 1979

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01719072

zbMATH Keywords

algorithmimplementationcomputational experiencesubgradient optimizationimplicit enumerationset partitioningheuristic for partitioninglinear side constraint

Mathematics Subject Classification ID

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

Related Items

Implicit enumeration algorithms for the set-partitioning problem

Cites Work

• The Truck Dispatching Problem
• An Algorithm for Large Set Partitioning Problems
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• Set Partitioning: A survey
• Validation of subgradient optimization
• A Heuristic Algorithm for the Vehicle-Dispatch Problem
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• Optimal Political Districting by Implicit Enumeration Techniques
• Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
• Set Covering by an All Integer Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Set partitioning mit linearen Randbedingungen