Pages that link to "Item:Q3716773"

The following pages link to A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints (Q3716773):

Displaying 50 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem (Q339543) (← links)
• Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← 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)
• Approximate solutions to large scale capacitated facility location problems (Q919754) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← 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)
• Efficient algorithms for the capacitated concentrator location problem (Q1088878) (← links)
• On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
• The \(K\)-coverage concentrator location problem (Q1193145) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
• A Lagrangean heuristic for the facility location problem with staircase costs (Q1278582) (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← 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)
• Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm (Q1762137) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• An improved Lagrangian relaxation and dual ascent approach to facility location problems (Q1789574) (← 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)
• An integrated approach for planning the adoption of client/server systems (Q1847259) (← 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)
• On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
• A feasibility-ensured Lagrangian heuristic for general decomposable problems (Q2068837) (← links)
• Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games (Q2123122) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
• Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
• A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem (Q3114903) (← links)
• A heuristic approach to the single facility maximin location problem (Q3696815) (← links)
• Lagrangian Relaxation and the Single-Source Capacitated Facility-Location Problem (Q3813577) (← links)
• NAFTA supply chains: facilities location and logistics (Q5438559) (← links)
• Planning and coordination of production and distribution facilities for multiple commodities (Q5946152) (← links)
• Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain (Q6070502) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)