Pages that link to "Item:Q797475"

The following pages link to A heuristic lagrangean algorithm for the capacitated plant location problem (Q797475):

Displaying 44 items.

• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Observations on some heuristic methods for the capacitated facility location problem (Q505112) (← links)
• A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
• The vendor location problem (Q547116) (← 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)
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type (Q811349) (← links)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← links)
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment (Q1065703) (← links)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• An algorithm for solving large capacitated warehouse location problems (Q1099067) (← links)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
• Algorithms for a multi-level network optimization problem (Q1307817) (← links)
• The design of reverse distribution networks: Models and solution procedures (Q1400663) (← links)
• A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. (Q1406697) (← links)
• Upper and lower bounds for the single source capacitated location problem. (Q1410616) (← links)
• An exact method for the two-echelon, single-source, capacitated facility location problem (Q1572966) (← links)
• A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
• A repeated matching heuristic for the single-source capacitated facility location problem (Q1610126) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← links)
• Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
• Heuristic methods and applications: A categorized survey (Q1823879) (← links)
• A simulated annealing methodology to distribution network design and management (Q1869415) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• Two-level vehicle routing with cross-docking in a three-echelon supply chain: a genetic algorithm approach (Q2285830) (← links)
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
• A cross decomposition algorithm for a multiproduct-multitype facility location problem (Q2368114) (← links)
• Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319) (← links)
• Capacitated facility location problem with general setup cost (Q2496021) (← links)
• Solving a class of stochastic mixed-integer programs with branch and price (Q2502208) (← links)
• A capacitated facility location problem with constrained backlogging probabilities (Q5428725) (← links)
• Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)
• Matheuristics: survey and synthesis (Q6056873) (← links)
• Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
• Locating Satellite Yards in Forestry Operations (Q6160212) (← links)