Publication:3037131
From MaRDI portal
zbMath0524.90064MaRDI QIDQ3037131
Publication date: 1982
distribution; scheduling; upper bound; heuristic; cutting planes; location; computational experience; subgradient optimization; set partitioning problem; weighted set covering
90C90: Applications of mathematical programming
90C10: Integer programming
90B35: Deterministic scheduling theory in operations research
90B05: Inventory, storage, reservoirs
52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)
05B40: Combinatorial aspects of packing and covering
Related Items
Robust Stabilization of Flexible Mechanical Systems Under Noise Uncertainties and Time-Varying Parameter Perturbations, A Mixed Robust/Optimal Active Vibration Control for Uncertain Flexible Structural Systems with Nonlinear Actuators Using Genetic Algorithm, Set covering approach for reconstruction of sibling relationships, Heuristic solutions and confidence intervals for the multicovering problem, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, An effective and simple heuristic for the set covering problem, The multicovering problem, Clustering heuristics for set covering, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
