Pages that link to "Item:Q3321802"

The following pages link to On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems (Q3321802):

Displaying 33 items.

• On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
• Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation (Q864015) (← links)
• The generalized assignment problem: Valid inequalities and facets (Q909579) (← links)
• A projection method for the uncapacitated facility location problem (Q918404) (← links)
• Location problems (Q1062596) (← links)
• On the 0,1 facets of the set covering polytope (Q1122477) (← links)
• Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
• Plant location with minimum inventory (Q1290654) (← links)
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
• New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
• On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
• On a connection between facility location and perfect graphs (Q1785286) (← links)
• The plant location problem with demand-dependent setup costs and centralized allocation (Q1806866) (← links)
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• A new lifting theorem for vertex packing (Q2329651) (← links)
• A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
• On the Location and p-Median Polytopes (Q2971602) (← links)
• LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
• Some facets of the simple plant location polytope (Q3945954) (← links)
• Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
• Exact Solution of Two Location Problems via Branch-and-Bound (Q5506728) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• New facets for the set packing polytope (Q5929145) (← links)
• Extreme points of discrete location polyhedra (Q5945254) (← links)
• A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
• New variants of the simple plant location problem and applications (Q6106762) (← links)