Pages that link to "Item:Q1290613"

The following pages link to Capacitated facility location: Separation algorithms and computational experience (Q1290613):

Displaying 44 items.

• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← 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)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
• Exact and heuristic approaches for the locational planning of an integrated solid waste management system (Q1035013) (← links)
• Distribution systems design with role dependent objectives (Q1039797) (← links)
• An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← links)
• Reformulation of capacitated facility location problems: How redundant information can help (Q1270613) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← 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)
• Global optimality conditions for fixed charge quadratic programs (Q1670551) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← 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)
• A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
• Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
• On the facets of the simple plant location packing polytope (Q1850113) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• A separation algorithm for the simple plant location problem (Q2060615) (← links)
• Lifting for mixed integer programs with variable upper bounds (Q2345614) (← links)
• An approximation algorithm for the \(n\)th power metric facility location problem with linear penalties (Q2359406) (← links)
• Fixed-charge transportation on a path: optimization, LP formulations and separation (Q2434997) (← links)
• Multi-period capacitated location with modular equipments (Q2456628) (← links)
• Parallel metaheuristics for workforce planning (Q2466392) (← links)
• Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• Locating repair shops in a stochastic environment (Q2581600) (← links)
• Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
• Solving Facility Location Problem Based on Duality Approach (Q2942470) (← links)
• Fixed-Charge Transportation on a Path: Linear Programming Formulations (Q3009780) (← links)
• Capacitated Facility Location: Valid Inequalities and Facets (Q4864872) (← 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)
• New variants of the simple plant location problem and applications (Q6106762) (← links)
• A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools (Q6492453) (← links)