Pages that link to "Item:Q1088878"

The following pages link to Efficient algorithms for the capacitated concentrator location problem (Q1088878):

Displaying 50 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• A coordinated planning model for the design of a distributed database system (Q707350) (← links)
• Model-based capacitated clustering with posterior regularization (Q724144) (← links)
• A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
• A mixed-integer approach to Core-Edge design of storage area networks (Q878574) (← links)
• The capacitated maximal covering location problem with backup service (Q920016) (← links)
• An effective VNS for the capacitated \(p\)-median problem (Q932177) (← links)
• Scatter search for the single source capacitated facility location problem (Q940848) (← 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)
• An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811) (← links)
• Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
• The \(K\)-coverage concentrator location problem (Q1193145) (← links)
• Locating concentrators in centralized computer networks (Q1197789) (← links)
• Optimal design of a distributed network with a two-level hierarchical structure (Q1203810) (← links)
• Auxiliary tool allocation in flexible manufacturing systems (Q1266742) (← links)
• Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem (Q1290717) (← links)
• On a cost allocation problem arising from a capacitated concentrator covering problem (Q1316101) (← 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 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)
• Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• Lagrangean heuristics for location problems (Q1804069) (← 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)
• A multiperiod planning model for the capacitated minimal spanning tree problem (Q1969870) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← 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)
• Lower and upper bounds for a two-level hierarchical location problem in computer networks (Q2462545) (← links)
• Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
• A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes (Q2481606) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• A scatter search heuristic for the capacitated clustering problem (Q2570154) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• A matheuristic for large-scale capacitated clustering (Q2668749) (← links)
• Combined capacity planning and concentrator location in computer communications networks (Q3496146) (← links)
• A multiplier adjustment technique for the capacitated concentrator location problem (Q4227929) (← links)
• Relaxation techniques applied to some loading problems (Q4327925) (← links)
• Topological Design of Centralized Computer Networks (Q4368605) (← links)
• Matheuristics for the capacitated p‐median problem (Q5246830) (← links)
• Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems (Q5506732) (← links)