Pages that link to "Item:Q1121793"

The following pages link to On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793):

Displaying 45 items.

• Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
• Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
• The anti-join composition and polyhedra (Q688264) (← links)
• Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
• Facets for art gallery problems (Q747627) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Solving the asymmetric traveling purchaser problem (Q867540) (← links)
• A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
• Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
• On the 0,1 facets of the set covering polytope (Q1122477) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
• Enhancing an algorithm for set covering problems (Q1194745) (← links)
• Directed Steiner problems with connectivity constraints (Q1315992) (← links)
• The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
• A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• Solving the multi-vehicle multi-covering tour problem (Q1651551) (← links)
• On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
• The traveling purchaser problem and its variants (Q1751767) (← links)
• Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
• Integer programming approach to static monopolies in graphs (Q1752610) (← links)
• Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
• Requiring connectivity in the set covering problem (Q1774524) (← links)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem (Q2007824) (← links)
• Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs (Q2081516) (← links)
• On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
• The Steiner connectivity problem (Q2434988) (← links)
• The minor inequalities in the description of the set covering polyhedron of circulant matrices (Q2441576) (← links)
• How to recycle your facets (Q2506820) (← links)
• Integer programming methods for solving binary interdiction games (Q2672065) (← links)
• Solving the close-enough arc routing problem (Q2811327) (← links)
• (Q2861547) (← links)
• (Q2861548) (← links)
• The Football Pool Polytope (Q3503533) (← links)
• Facetas del politopo de recubrimiento con coeficientes en {0, 1, 2, 3} (Q4022746) (← links)
• Transitive packing (Q4645940) (← links)
• Set covering approach for reconstruction of sibling relationships (Q5758164) (← links)
• New computational approaches for the power dominating set problem: Set covering and the neighborhoods of zero forcing forts (Q6065861) (← links)
• An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
• Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations (Q6102859) (← links)
• A flow-based model for the multivehicle covering tour problem with route balancing (Q6495377) (← links)