Pages that link to "Item:Q1124811"

The following pages link to An exact algorithm for the capacitated facility location problems with single sourcing (Q1124811):

Displaying 48 items.

• Metaheuristic applications on discrete facility location problems: a survey (Q260627) (← links)
• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• An implementation of exact knapsack separation (Q330511) (← links)
• Efficient solution of a class of location-allocation problems with stochastic demand and congestion (Q337037) (← links)
• The vendor location problem (Q547116) (← links)
• Facility location models for distribution system design (Q707128) (← links)
• MIP reformulations of the probabilistic set covering problem (Q847820) (← links)
• A facility location model for logistics systems including reverse flows: the case of remanufacturing activities (Q850279) (← 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)
• 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 bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← 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 new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• Data-driven distributionally robust capacitated facility location problem (Q2030664) (← links)
• Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
• Designing a service system with price- and distance-sensitive demand: a case study in mining industry (Q2160527) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Benders decomposition, Lagrangean relaxation and metaheuristic design (Q2271124) (← links)
• Combining very large scale and ILP based neighborhoods for a two-level location problem (Q2356178) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• Location of slaughterhouses under economies of scale (Q2433439) (← links)
• Stochastic facility location with general long-run costs and convex short-run costs (Q2475855) (← links)
• Optimizing over the split closure (Q2476990) (← links)
• On the capacitated concentrator location problem: a reformulation by discretization (Q2496022) (← links)
• Hybrid scatter search and path relinking for the capacitated \(p\)-median problem (Q2570156) (← links)
• A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences (Q2664416) (← links)
• Robust design of service systems with immobile servers under demand uncertainty (Q2676366) (← links)
• Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem (Q2815453) (← links)
• Exactly solving a two-level location problem with modular node capacities (Q2892154) (← links)
• Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
• Probabilistic Guarantees in Robust Optimization (Q5013583) (← links)
• Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion (Q5058005) (← links)
• Bilevel Integer Programs with Stochastic Right-Hand Sides (Q5084620) (← links)
• A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations (Q5140720) (← links)
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
• The value of the multi-period solution revisited: when to model time in capacitated location problems (Q6065619) (← links)
• Designing service system networks with interruption risks (Q6066674) (← links)
• Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation (Q6109334) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
• Locating Satellite Yards in Forestry Operations (Q6160212) (← links)
• Modeling and solving an economies‐of‐scale service system design problem (Q6187314) (← links)