Pages that link to "Item:Q1262820"

The following pages link to Valid inequalities and facets of the capacitated plant location problem (Q1262820):

Displaying 34 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis (Q535673) (← links)
• Models for planning capacity expansion in local access telecommunication networks (Q806810) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• Polyhedral analysis for concentrator location problems (Q853560) (← links)
• On solving large instances of the capacitated facility location problem (Q859676) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• Submodularity and valid inequalities in capacitated fixed charge networks (Q1121763) (← links)
• Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
• Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
• Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
• Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
• New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← links)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
• Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)
• The capacitated plant location problem with multiple facilities in the same site (Q1941959) (← links)
• Valid inequalities and separation for capacitated fixed charge flow problems (Q1962074) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• Integrated design and operation of remnant inventory supply chains under uncertainty (Q2275828) (← links)
• The splittable flow arc set with capacity and minimum load constraints (Q2450712) (← links)
• Multi-period capacitated location with modular equipments (Q2456628) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Discretized formulations for capacitated location problems with modular distribution costs (Q2655611) (← links)
• A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
• Discrete equal-capacityp-median problem (Q4949164) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• Extreme points of discrete location polyhedra (Q5945254) (← links)
• A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
• A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)
• The value of the multi-period solution revisited: when to model time in capacitated location problems (Q6065619) (← links)
• An integrated <scp>user‐system</scp> approach for shelter location and evacuation routing (Q6087143) (← links)