Efficient Solutions for Special Zero-One Programming Problems Ariela BilitzkyArik Sadeh OriginalPaper Pages: 227 - 238
Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem Mhand HifiHedi MhallaSlim Sadfi OriginalPaper Pages: 239 - 260
Vertices Contained in all or in no Minimum Paired-Dominating Set of a Tree Michael A. HenningMichael D. Plummer OriginalPaper Pages: 283 - 294