Pages that link to "Item:Q3945954"

The following pages link to Some facets of the simple plant location polytope (Q3945954):

Displaying 36 items.

• On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
• Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
• A projection method for the uncapacitated facility location problem (Q918404) (← links)
• On the \(p\)-median polytope of \(Y\)-free graphs (Q951093) (← links)
• A comparison of two dual-based procedures for solving the p-median problem (Q1058960) (← links)
• Location problems (Q1062596) (← links)
• On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
• Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← 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)
• Separating lifted odd-hole inequalities to solve the index selection problem (Q1304469) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
• The connected facility location polytope (Q1686059) (← 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)
• 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)
• The simple plant location problem: Survey and synthesis (Q1837098) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)
• The double-assignment plant location problem with co-location (Q2026959) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• Facets of the three-index assignment polytope (Q2276881) (← links)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• On the Location and p-Median Polytopes (Q2971602) (← links)
• LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← 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)