scientific article
From MaRDI portal
Publication:3037131
zbMath0524.90064MaRDI QIDQ3037131
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
distributionschedulingupper boundheuristiccutting planeslocationcomputational experiencesubgradient optimizationset partitioning problemweighted set covering
Applications of mathematical programming (90C90) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Inventory, storage, reservoirs (90B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, An effective and simple heuristic for the set covering problem, Probabilistic Partial Set Covering with an Oracle for Chance Constraints, The multicovering problem, A Mixed Robust/Optimal Active Vibration Control for Uncertain Flexible Structural Systems with Nonlinear Actuators Using Genetic Algorithm, Heuristic solutions and confidence intervals for the multicovering problem, Set covering approach for reconstruction of sibling relationships, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, Clustering heuristics for set covering, Robust Stabilization of Flexible Mechanical Systems Under Noise Uncertainties and Time-Varying Parameter Perturbations
