Pages that link to "Item:Q3725832"

The following pages link to A Cross Decomposition Algorithm for Capacitated Facility Location (Q3725832):

Displaying 50 items.

• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
• A robust optimisation model and cutting planes for the planning of energy-efficient wireless networks (Q339546) (← links)
• Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
• Optimal Physician assignment and patient demand allocation in an outpatient care network (Q342387) (← links)
• A hybrid approach of bundle and Benders applied large mixed linear integer problem (Q364462) (← links)
• Preprocessing for a map sectorization problem by means of mathematical programming (Q490244) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing (Q750288) (← links)
• On the convergence of cross decomposition (Q752000) (← links)
• Cross decomposition applied to the stochastic transportation problem (Q799587) (← links)
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
• A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347) (← links)
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
• Modelling a fertiliser distribution system (Q811356) (← links)
• Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort (Q856273) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• A perturbation-based heuristic for the capacitated multisource Weber problem (Q864040) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• Exact algorithms for the joint object placement and request routing problem in content distribution networks (Q925830) (← links)
• Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
• A genetic algorithm for a single product network design model with lead time and safety stock considerations (Q1014964) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• Optimal location with equitable loads (Q1026600) (← links)
• Heuristics for the capacitated plant location model (Q1051554) (← links)
• An algorithm for solving large capacitated warehouse location problems (Q1099067) (← links)
• On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem (Q1171987) (← links)
• Locational analysis (Q1173002) (← links)
• Decomposition in global optimization (Q1186267) (← links)
• Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
• A fuzzy set-theoretic method for public facility location (Q1197655) (← links)
• An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies (Q1198290) (← links)
• Linear mean value cross decomposition: A generalization of the Kornai- Liptak method (Q1203802) (← links)
• Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
• Creative modeling: Variable and constraint duplication in primal-dual decomposition methods (Q1270618) (← links)
• A multi-product loading problem: A model and solution method (Q1278990) (← links)
• Planning and scheduling packaging lines in food industry (Q1309991) (← links)
• On using approximations of the Benders master problem (Q1333479) (← links)
• Solving the staircase cost facility location problem with decomposition and piecewise linearization (Q1333508) (← links)
• Multi-item capacitated lot-sizing by a cross decomposition based algorithm (Q1339158) (← links)
• Location and layout planning. A survey (Q1372765) (← links)
• A model for the capacitated \(p\)-facility location problem in global environments (Q1374025) (← links)
• The capacitated plant location problem (Q1390274) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
• A new cross decomposition method for stochastic mixed-integer linear programming (Q1752218) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• Design of a distribution network using primal-dual decomposition (Q1793572) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Integrated production/distribution planning in supply chains: An invited review (Q1809796) (← links)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)