Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
From MaRDI portal
Publication:3487135
DOI10.1287/mnsc.36.6.674zbMath0706.90048OpenAlexW2096090773MaRDI QIDQ3487135
Pradeep Kedia, Marshall L. Fisher
Publication date: 1990
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.36.6.674
Numerical mathematical programming methods (65K05) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Lagrangean relaxation. (With comments and rejoinder)., The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, An algorithm for the planar three-index assignment problem, A surrogate heuristic for set covering problems, The matching relaxation for a class of generalized set partitioning problems, A monotonic, dual-based bounding procedure for integer programs, An efficient local search heuristic with row weighting for the unicost set covering problem, A packet filter placement problem with application to defense against spoofed denial of service attacks, An effective and simple heuristic for the set covering problem, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, A dual strategy for solving the linear programming relaxation of a driver scheduling system, A simulated evolution-based solution of the cover problem, Algorithms for railway crew management, Solving large set covering problems for crew scheduling, Application of a hybrid genetic algorithm to airline crew scheduling, Tighter representations for set partitioning problems, A hybrid heuristic for the set covering problem, A GRASP algorithm to solve the unicost set covering problem, A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Solving hard set covering problems, Graph theoretic relaxations of set covering and set partitioning problems, Use of hidden network structure in the set partitioning problem, Matheuristics: survey and synthesis, MLQCC: an improved local search algorithm for the set k‐covering problem, The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic, A binary monkey search algorithm variation for solving the set covering problem, Delivering complex decision rules to top level managers through decision support systems: A case study in army housing management., Hybrid heuristic algorithms for set covering., Humanitarian logistics planning for natural disaster response with Bayesian information updates, Evaluation of reliability bounds by set covering models., A relax-and-cut algorithm for the set partitioning problem, An improved configuration checking-based algorithm for the unicost set covering problem, A heuristic algorithm for the set covering problem, Enhancing an algorithm for set covering problems, Benders decomposition for set covering problems. Almost satisfying the consecutive ones property, A dual ascent procedure for the set partitioning problem, A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints, Set covering-based surrogate approach for solving sup-\({\mathcal{T}}\) equation constrained optimization problems, A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints, A 3-flip neighborhood local search for the set covering problem, Surrogate constraint normalization for the set covering problem, Solving a fuzzy set-covering problem, Set covering approach for reconstruction of sibling relationships, The set covering problem revisited: an empirical study of the value of dual information, A set-covering model for optimizing selection of portfolio of microcontrollers in an automotive supplier company, Efficient feature selection for logical analysis of large-scale multi-class datasets, Modeling and Managing Uncertainty in Process Planning and Scheduling, A new approach for solving set covering problem using jumping particle swarm optimization method, Solving the non-unicost set covering problem by using cuckoo search and black hole optimization, An adaptation of SH heuristic to the location set covering problem, A genetic algorithm for the set covering problem, Simple Lagrangian heuristic for the set covering problem, A multi-product loading problem: A model and solution method, An application-oriented guide for designing Lagrangean dual ascent algorithms, A self-adaptive biogeography-based algorithm to solve the set covering problem, A Lagrangian-based heuristic for large-scale set covering problems, Exploring further advantages in an alternative formulation for the set covering problem, Clustering heuristics for set covering, A set covering approach for multi-depot train driver scheduling, Experiments with parallel branch-and-bound algorithms for the set covering problem, A parallel genetic algorithm to solve the set-covering problem, A concurrent processing framework for the set partitioning problem, OPTIMAL SET-PARTITIONING BASED ON GROUP QUALITY LIKELIHOOD USING PARTITION-GROWING ALGORITHM
