Pages that link to "Item:Q5181532"

The following pages link to On the facial structure of set packing polyhedra (Q5181532):

Displaying 50 items.

• A hybrid evolutionary approach for set packing problem (Q260677) (← links)
• Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
• On the completability of incomplete orthogonal Latin rectangles (Q267209) (← links)
• Integer programming techniques for the nurse rostering problem (Q284423) (← links)
• A polyhedral investigation of star colorings (Q284838) (← links)
• Near optimal design of wavelength routed optical networks (Q322603) (← links)
• A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← 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 the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
• A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
• How tight is the corner relaxation? Insights gained from the stable set problem (Q448970) (← links)
• The Hirsch conjecture for the fractional stable set polytope (Q463733) (← links)
• A branch and cut solver for the maximum stable set problem (Q491210) (← links)
• Faster separation of 1-wheel inequalities by graph products (Q496437) (← links)
• A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
• Lovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphs (Q517302) (← 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)
• Lifting, tilting and fractional programming revisited (Q614041) (← links)
• On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
• A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Stochastic set packing problem (Q713096) (← links)
• On linear and semidefinite programming relaxations for hypergraph matching (Q715088) (← links)
• An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
• The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are \(\mathcal{G}\)-perfect (Q740644) (← links)
• A min-max relation for the partial q-colourings of a graph. II: Box perfection (Q752726) (← links)
• Minimal covers, minimal sets and canonical facets of the posynomial knapsack polytope (Q761350) (← links)
• Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm (Q811891) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Integer-programming software systems (Q817202) (← links)
• Airline crew scheduling: state-of-the-art (Q817210) (← links)
• New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
• On the orthogonal Latin squares polytope (Q819807) (← links)
• Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
• A polyhedral view to a generalization of multiple domination (Q832985) (← links)
• Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
• Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
• Polyhedral analysis for concentrator location problems (Q853560) (← links)
• Frequency reassignment problem in mobile communication networks (Q878566) (← links)
• A computational study of a cutting plane algorithm for university course timetabling (Q880517) (← links)
• The stable set polytope of icosahedral graphs (Q898118) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• On the completability of incomplete Latin squares (Q966163) (← links)
• A computational study of exact knapsack separation for the generalized assignment problem (Q967219) (← links)