Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
From MaRDI portal
Publication:5668254
DOI10.1287/mnsc.19.5.528zbMath0254.90042OpenAlexW2097701912MaRDI QIDQ5668254
Jeffrey S. Lasky, John F. Pierce
Publication date: 1973
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.19.5.528
Related Items
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems ⋮ Aggregation of constraints in integer programming ⋮ Implicit enumeration algorithms for the set-partitioning problem ⋮ Set partitioning mit linearen Randbedingungen ⋮ An effective structured approach to finding optimal partitions of networks ⋮ Performance of a neural network method with set partitioning ⋮ Modeling and algorithmic development of a staff scheduling problem ⋮ Benchmark data set with service programs to approximately solve the set covering problem ⋮ An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth ⋮ Balancing modular transfer lines with serial-parallel activation of spindle heads at stations ⋮ Opening a web site at which one can get a benchmark input data set to solve the set covering problem ⋮ A computational study of a genetic algorithm to solve the set covering problem ⋮ Branch and bound algorithm for a transfer line design problem: stations with sequentially activated multi-spindle heads
This page was built for publication: Improved Combinatorial Programming Algorithms for a Class of All-Zero-One Integer Programming Problems
