On the facial structure of set packing polyhedra
From MaRDI portal
Publication:5181532
Cites work
- scientific article; zbMATH DE number 3427118 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 3297030 (Why is no real title available?)
- scientific article; zbMATH DE number 3333883 (Why is no real title available?)
- scientific article; zbMATH DE number 3353075 (Why is no real title available?)
- scientific article; zbMATH DE number 3361920 (Why is no real title available?)
- scientific article; zbMATH DE number 3420483 (Why is no real title available?)
- Blocking and anti-blocking pairs of polyhedra
- Covers and packings in a family of sets
- Extensions of the Group Theoretic Approach in Integer Programming
- Maximum matching and a polyhedron with 0,1-vertices
- On the Set-Covering Problem
- Some polyhedra related to combinatorial problems
- The Set-Partitioning Problem: Set Covering with Equality Constraints
Cited in
(only showing first 100 items - show all)- A relax-and-cut algorithm for the set partitioning problem
- Routing trains through railway stations: Complexity issues
- Classical cuts for mixed-integer programming and branch-and-cut
- Polyhedral results for the precedence-constrained knapsack problem
- On the orthogonal Latin squares polytope
- Solving the set packing problem via a maximum weighted independent set heuristic
- Strengthening Chvátal-Gomory cuts for the stable set problem
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint
- Dynamic node packing
- A fast approximation algorithm for solving the complete set packing problem
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- Capacitated facility location: Separation algorithms and computational experience
- On cliques associated to 3-set packing problems
- The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are \(\mathcal{W}\)-perfect
- Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
- The rank pricing problem: models and branch-and-cut algorithms
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- On identifying dominant cliques.
- A hybrid evolutionary approach for set packing problem
- Coloring planar Toeplitz graphs and the stable set polytope.
- A cutting plane method for knapsack polytope
- On the completability of incomplete orthogonal Latin rectangles
- The (not so) trivial lifting in two dimensions
- A polyhedral view to a generalization of multiple domination
- Valid inequalities, cutting planes and integrality of the knapsack polytope
- A smaller extended formulation for the odd cycle inequalities of the stable set polytope
- Sequence independent lifting of cover inequalities
- A new lifting theorem for vertex packing
- Hybridization of GRASP metaheuristic with data mining techniques
- The maximum clique problem
- A new facet generating procedure for the stable set polytope
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators
- Strengthened clique-family inequalities for the stable set polytope
- On the membership problem for the \({0, 1/2}\)-closure
- New facets for the two-stage uncapacitated facility location polytope
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem
- The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect
- Lifting for the integer knapsack cover polyhedron
- Facets from gadgets
- The graphical relaxation: A new framework for the symmetric traveling salesman polytope
- A concurrent processing framework for the set partitioning problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- New variants of the simple plant location problem and applications
- Use of hidden network structure in the set partitioning problem
- Transitive packing
- On ternary problems
- On a composition of independence systems by circuit identification
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
- New facets of the STS polytope generated from known facets of the ATS polytope
- Adapting polyhedral properties from facility to hub location problems
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
- The generalized assignment problem: Valid inequalities and facets
- Persistency of linear programming relaxations for the stable set problem
- Gear composition and the stable set polytope
- Discrete relaxations of combinatorial programs
- New formulations for the uncapacitated multiple allocation hub location problem
- Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
- The stable set polytope of claw-free graphs with large stability number
- Persistency of linear programming relaxations for the stable set problem
- Lifting convex inequalities for bipartite bilinear programs
- Lifting convex inequalities for bipartite bilinear programs
- A new approach to the stable set problem based on ellipsoids
- Integer programming techniques for the nurse rostering problem
- A polyhedral investigation of star colorings
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts
- A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design
- On tightening cover induced inequalities
- A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
- Lovász and Schrijver \(N_+\)-relaxation on web graphs
- On the Lovász theta function and some variants
- Valid inequalities for mips and group polyhedra from approximate liftings
- On the completability of incomplete Latin squares
- A stronger LP bound for formula size lower bounds via clique constraints
- Determining the number of internal stability of a graph
- Perfect zero–one matrices
- Polyhedral analysis for concentrator location problems
- Cutting planes for integer programs with general integer variables
- A generalization of antiwebs to independence systems and their canonical facets
- Near-perfect matrices
- A guide to conic optimisation and its applications
- Integer-programming software systems
- The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
- Generalized cover facet inequalities for the generalized assignment problem
- On Latin squares and the facial structure of related polytopes
- On cutting-plane proofs in combinatorial optimization
- A simple effective heuristic for embedded mixed-integer quadratic programming
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks
- A class of facet producing graphs for vertex packing polyhedra
- A network relaxation based enumeration algorithm for set partitioning
- \(O(n \log n)\) procedures for tightening cover inequalities
- The summed start-up costs in a unit commitment problem
- A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem
- Virtual private network design over the first Chvátal closure
- Strong IP formulations need large coefficients
- Stochastic set packing problem
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
- The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm
- Separating lifted odd-hole inequalities to solve the index selection problem
This page was built for publication: On the facial structure of set packing polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5181532)
