Cutting planes from conditional bounds: A new approach to set covering
From MaRDI portal
Publication:3875703
DOI10.1007/BFb0120885zbMath0435.90073OpenAlexW1511862326MaRDI QIDQ3875703
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120885
algorithmscutting planesvalid inequalitiesset coveringfacetscomputational studyconditional boundsconditional lower bound
Related Items
The continuousm-center problem on a network, The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems, On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\), On the 0,1 facets of the set covering polytope, On the facial structure of the set covering polytope, On cutting-plane proofs in combinatorial optimization, Facets and lifting procedures for the set covering polytope, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Enumeration technique for solving multi-objective quadratic set-covering problem using goal programming, Use of hidden network structure in the set partitioning problem, Evaluation of reliability bounds by set covering models., A goal programming approach to solve linear fractional multi-objective set covering problem., The multicovering problem, Computing the spark: mixed-integer programming for the (vector) matroid girth problem, Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning», A restricted Lagrangean approach to the traveling salesman problem, An algorithm for set covering problem, Exploring further advantages in an alternative formulation for the set covering problem, Note: A local-search heuristic for large set-covering problems, Algorithms for large scale set covering problems
