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.
- The generalized independent set problem: polyhedral analysis and solution approaches (Q1753398) (← links)
- The strength of Dantzig-Wolfe reformulations for the stable set and related problems (Q1756353) (← links)
- Ehrhart series of fractional stable set polytopes of finite graphs (Q1787967) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Fractional matroid matchings (Q1812954) (← links)
- Matchings and covers in hypergraphs (Q1813100) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- Fixed cardinality stable sets (Q1983123) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- The unsuitable neighbourhood inequalities for the fixed cardinality stable set polytope (Q2056893) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Dynamic node packing (Q2097666) (← links)
- Nearly optimal robust secret sharing against rushing adversaries (Q2102061) (← links)
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
- Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem (Q2168733) (← links)
- Sparse obstructions for minor-covering parameters (Q2174553) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Optimizing over pure stationary equilibria in consensus stopping games (Q2281451) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- On the facets of lift-and-project relaxations under graph operations (Q2448871) (← links)
- Crown reductions for the minimum weighted vertex cover problem (Q2473030) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Complementation in T-perfect graphs (Q2672429) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- A New Facet Generating Procedure for the Stable Set Polytope (Q2840706) (← links)
- Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model (Q2940542) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- Valid inequalities, cutting planes and integrality of the knapsack polytope (Q3101539) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Typical performance of approximation algorithms for NP-hard problems (Q3302475) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- (1,k)-configurations and facets for packing problems (Q3869083) (← links)
- A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles (Q3899836) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Vertex packings: Structural properties and algorithms (Q4074668) (← links)
- Faces for a linear inequality in 0–1 variables (Q4074671) (← links)
- Facet of regular 0–1 polytopes (Q4074672) (← links)
- Facets of the knapsack polytope (Q4077731) (← links)
- Further facet generating procedures for vertex packing polytopes (Q4119038) (← links)
