Pages that link to "Item:Q4766816"
From MaRDI portal
The following pages link to Properties of vertex packing and independence system polyhedra (Q4766816):
Displaying 50 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect (Q403365) (← links)
- On fractional realizations of graph degree sequences (Q405210) (← links)
- Handelman's hierarchy for the maximum stable set problem (Q480821) (← links)
- Cutting planes from extended LP formulations (Q507316) (← links)
- Efficient stabilization of cooperative matching games (Q526875) (← 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)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
- Strong and weak edges of a graph and linkages with the vertex cover problem (Q765356) (← links)
- On certain classes of fractional matchings (Q798265) (← links)
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- Minimum partition of an independence system into independent sets (Q1013303) (← links)
- Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- The complexity of facets (and some facets of complexity) (Q1061485) (← links)
- On ternary problems (Q1121787) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
- Discrete extremal problems (Q1152306) (← links)
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- A class of facet producing graphs for vertex packing polyhedra (Q1220520) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- The maximum clique problem (Q1318271) (← links)
- Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
- Complexity of searching an immobile hider in a graph (Q1377669) (← links)
- On certain polytopes associated with graphs (Q1393418) (← links)
- A polyhedral approach to sequence alignment problems (Q1585327) (← links)
- Erratum to ``Comparison of column generation models for channel assignment in cellular networks'' (Q1602699) (← links)
- More complete intersection theorems (Q1618227) (← links)
- A capacitated hub location problem under hose demand uncertainty (Q1651522) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
