On the facial structure of set packing polyhedra

Related Items

A Lagrangean decomposition for the maximum independent set problem applied to map labeling, The facets and the symmetries of the approval-voting polytope, Accurate optimization models for interference constrained bandwidth allocation in cellular networks, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, Tramp ship routing and scheduling with voyage separation requirements, A comparative study of formulations and solution methods for the discrete ordered $p$-median problem, An application of the Lovász-Schrijver $M(K, K)$ operator to the stable set problem, A cutting plane method for knapsack polytope, Stability critical graphs and ranks facets of the stable set polytope, The summed start-up costs in a unit commitment problem, New facets for the two-stage uncapacitated facility location polytope, An evolutionary algorithm based hyper-heuristic framework for the set packing problem, Improved formulations and branch-and-cut algorithms for the angular constrained minimum spanning tree problem, Time-tables, polyhedra and the greedy algorithm, The stable set problem: clique and nodal inequalities revisited, A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems, Solving a Multigroup Mixed-Integer Programming-Based Constrained Discrimination Model, Cover by disjoint cliques cuts for the knapsack problem with conflicting items, Total coloring and total matching: polyhedra and facets, On the facets of stable set polytopes of circular interval graphs, Integral simplex using decomposition with primal cutting planes, Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms, On the complete set packing and set partitioning polytopes: properties and rank 1 facets, A branch-and-cut algorithm for the generalized traveling salesman problem with time windows, Structural Investigation of Piecewise Linearized Network Flow Problems, The clique problem with multiple-choice constraints under a cycle-free dependency graph, On the 2-Club Polytope of Graphs, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation, The time dependent traveling salesman problem: polyhedra and algorithm, Single-facility scheduling by logic-based Benders decomposition, 2-clique-bond of stable set polyhedra, The rank pricing problem: models and branch-and-cut algorithms, On the facets of lift-and-project relaxations under graph operations, Facets from gadgets, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Conflict graphs in solving integer programming problems, A new approach for modeling and solving set packing problems, A relax-and-cut algorithm for the set partitioning problem, The $k$-Track assignment problem on partial orders, A smaller extended formulation for the odd cycle inequalities of the stable set polytope, A cutting plane algorithm for graph coloring, A branch-and-price algorithm for the scheduling of customer visits in the context of multi-period service territory design, Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph, On the mixed set covering, packing and partitioning polytope, On the $p$-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs, On the Lovász theta function and some variants, The generalized independent set problem: polyhedral analysis and solution approaches, The strength of Dantzig-Wolfe reformulations for the stable set and related problems, A model predictive control approach for discrete-time rescheduling in complex central railway station areas, A branch and cut algorithm for minimum spanning trees under conflict constraints, A branch-and-cut algorithm for graph coloring, Exploring the relationship between max-cut and stable set relaxations, Unnamed Item, Unnamed Item, A new class of facets for the Latin square polytope, A branch and cut algorithm for hub location problems with single assignment, On multi-index assignment polytopes, New facets of the STS polytope generated from known facets of the ATS polytope, Searching for mutually orthogonal Latin squares via integer and constraint programming, Strong IP formulations need large coefficients, Polyhedral properties of the induced cluster subgraphs, A branch-and-cut algorithm for the pallet loading problem, Facets of the three-index assignment polytope, Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints, The double-assignment plant location problem with co-location, A polyhedral study on 0-1 knapsack problems with set packing constraints, Hybridization of GRASP metaheuristic with data mining techniques, The (not so) trivial lifting in two dimensions, Extended formulations for vertex cover, A fast approximation algorithm for solving the complete set packing problem, The graphical relaxation: A new framework for the symmetric traveling salesman polytope, Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut, On identifying dominant cliques., An $O(n \log n)$ procedure for identifying facets of the knapsack polytope., A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, On the complexity of surrogate and group relaxation for integer linear programs, Strengthened clique-family inequalities for the stable set polytope, On Latin squares and the facial structure of related polytopes, A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching, Facets and algorithms for capacitated lot sizing, Strengthening Chvátal-Gomory Cuts for the Stable Set Problem, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, Frequency assignment in mobile radio systems using branch-and-cut techniques, A New Facet Generating Procedure for the Stable Set Polytope, A new lifting theorem for vertex packing, Strong bounds for resource constrained project scheduling: preprocessing and cutting planes, Worst-case analysis of clique MIPs, On the facets of the simple plant location packing polytope, Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph, A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming, Dynamic node packing, Routing trains through a railway station based on a node packing model, On cycles and the stable multi-set polytope, The wheels of the orthogonal Latin squares polytope: classification and valid inequalities, A characterization of odd-hole inequalities related to Latin squares, Erratum to ``Comparison of column generation models for channel assignment in cellular networks, A concurrent processing framework for the set partitioning problem, The maximum balanced subgraph of a signed graph: applications and solution approaches, Persistency of linear programming relaxations for the stable set problem, New formulations for the uncapacitated multiple allocation hub location problem, On the completability of incomplete orthogonal Latin rectangles, On the orthogonal Latin squares polytope, Polyhedral consequences of the amalgam operation, Near-perfect matrices, Solving the set packing problem via a maximum weighted independent set heuristic, Integer programming techniques for the nurse rostering problem, A polyhedral investigation of star colorings, A polyhedral view to a generalization of multiple domination, A decomposition of 2-weak vertex-packing polytopes, Vertex packing problem application to the design of electronic testing fixtures, Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem, Algorithms to separate $\{0,\frac{1}{2}\}$-Chvátal-Gomory cuts, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Near optimal design of wavelength routed optical networks, Order preserving assignments without contiguity, Polyhedral analysis for concentrator location problems, A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks, Some properties of cliques in 0-1 mixed integer programs, Solving the anti-covering location problem using Lagrangian relaxation, On ternary 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, A generalization of antiwebs to independence systems and their canonical facets, The Boolean quadratic polytope: Some characteristics, facets and relatives, On the facial structure of the set covering polytope, Facets of the balanced (acyclic) induced subgraph polytope, A network relaxation based enumeration algorithm for set partitioning, On cutting-plane proofs in combinatorial optimization, $O(n \log n)$ procedures for tightening cover inequalities, Frequency reassignment problem in mobile communication networks, Strong lift-and-project cutting planes for the stable set problem, A computational study of a cutting plane algorithm for university course timetabling, Exact and approximation algorithms for the operational fixed interval scheduling problem, Strong formulation for the spot 5 daily photograph scheduling problem, Lifting, tilting and fractional programming revisited, On certain polytopes associated with graphs, The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are $\mathcal{W}$-perfect, On the membership problem for the ${0, 1/2}$-closure, The stable set polytope of icosahedral graphs, Polytope des independants d'un graphe série-parallèle, Discrete extremal problems, A stronger LP bound for formula size lower bounds via clique constraints, On the facets of the stable set polytope of quasi-line graphs, The generalized assignment problem: Valid inequalities and facets, Foundation-penalty cuts for mixed-integer programs., Clique family inequalities for the stable set polytope of quasi-line graphs., How tight is the corner relaxation? Insights gained from the stable set problem, GRASP for set packing problems., Coloring planar Toeplitz graphs and the stable set polytope., On stable set polyhedra for K//(1,3)free graphs, The Hirsch conjecture for the fractional stable set polytope, A set partitioning reformulation of a school bus scheduling problem, The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities, A branch and cut solver for the maximum stable set problem, On a composition of independence systems by circuit identification, Faster separation of 1-wheel inequalities by graph products, Clique-circulants and the stable set polytope of fuzzy circular interval graphs, A branch and cut heuristic for a runway scheduling problem, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, On tightening cover induced inequalities, On the completability of incomplete Latin squares, Polyhedral results for the precedence-constrained knapsack problem, A computational study of exact knapsack separation for the generalized assignment problem, Cutting planes in integer and mixed integer programming, Adapting polyhedral properties from facility to hub location problems, A class of facet producing graphs for vertex packing polyhedra, Stochastic set packing problem, On linear and semidefinite programming relaxations for hypergraph matching, An exact approach to the problem of extracting an embedded network matrix, On the set covering polytope. II: Lifting the facets with coefficients in $\{$ 0,1,2$\}$, A new mathematical model and a Lagrangean decomposition for the point-feature cartographic label placement problem, The stable set polytope for some extensions of $P_4$-free graphs, Gear composition and the stable set polytope, The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are $\mathcal{G}$-perfect, Valid inequalities and facets of the capacitated plant location problem, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Valid inequalities for mips and group polyhedra from approximate liftings, A min-max relation for the partial q-colourings of a graph. II: Box perfection, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope, Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case, Routing trains through railway stations: Complexity issues, Facets for node packing, Clique facets of the axial and planar assignment polytopes, Capacitated facility location: Separation algorithms and computational experience, Cutting planes for integer programs with general integer variables, Separating lifted odd-hole inequalities to solve the index selection problem, On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint, The complexity of facets (and some facets of complexity), The maximum clique problem, $K_ i$-covers. I: Complexity and polytopes, Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm, A hybrid evolutionary approach for set packing problem, Cover and pack inequalities for (mixed) integer programming, Integer-programming software systems, Airline crew scheduling: state-of-the-art, Light on the infinite group relaxation. I: Foundations and taxonomy, Determining the number of internal stability of a graph, Persistency of Linear Programming Relaxations for the Stable Set Problem, Binary group and Chinese postman polyhedra, Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs, Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning, Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming, Use of hidden network structure in the set partitioning problem, Sequence independent lifting of cover inequalities, An extended formulation for the 1‐wheel inequalities of the stable set polytope, Recycling inequalities for robust combinatorial optimization with budget uncertainty, Lifting for the integer knapsack cover polyhedron, New variants of the simple plant location problem and applications, Tighter bounds on the minimum broadcast time, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, Valid Inequalities and Separation Algorithms for the Set Partitioning Problem, Maximum weight perfect matching problem with additional disjunctive conflict constraints, Vertex packings: Structural properties and algorithms, Facets of the knapsack polytope, A guide to conic optimisation and its applications, Generalized cover facet inequalities for the generalized assignment problem, Classical cuts for mixed-integer programming and branch-and-cut, A New Approach to the Stable Set Problem Based on Ellipsoids, Transitive packing, A tutorial on branch and cut algorithms for the maximum stable set problem, Lineare Charakterisierungen von Travelling Salesman Problemen, Further facet generating procedures for vertex packing polytopes, New facets for the set packing polytope, Discrete relaxations of combinatorial programs, Comparison of column generation models for channel assignment in cellular networks, Clique-connecting forest and stable set polytopes, Lifting the facets of zero–one polytopes, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, (1,k)-configurations and facets for packing problems, A simple effective heuristic for embedded mixed-integer quadratic programming, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, The generalized minimum spanning tree problem: Polyhedral analysis and branch-and-cut algorithm, Valid inequalities, cutting planes and integrality of the knapsack polytope, Unnamed Item, The Ring Star Problem: Polyhedral analysis and exact algorithm, Virtual private network design over the first Chvátal closure, On the Stable Set Polytope of Claw-Free Graphs, Some facets of the simple plant location polytope, On cliques associated to 3-set packing problems, Properties of vertex packing and independence system polyhedra, Perfect zero–one matrices

Cites Work