Pages that link to "Item:Q864031"

The following pages link to A branch-and-price algorithm for the capacitated facility location problem (Q864031):

Displaying 35 items.

• Branch-and-price and constraint programming for solving a real-life technician dispatching problem (Q296755) (← links)
• Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
• Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks (Q337548) (← links)
• A hybrid firefly-genetic algorithm for the capacitated facility location problem (Q508597) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← links)
• Capacitated location model with online demand pooling in a multi-channel supply chain (Q992600) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• A computational evaluation of a general branch-and-price framework for capacitated network location problems (Q1026595) (← links)
• A bi-objective approach to discrete cost-bottleneck location problems (Q1615950) (← links)
• A profit-maximization location-routing-pricing problem: a branch-and-price algorithm (Q1653368) (← links)
• Variations in the flow approach to CFCLP-TC for multiobjective supply chain design (Q1719200) (← 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)
• A column generation heuristic for optimal wireless sensor network design with mobile sinks (Q1753436) (← links)
• A branch-and-price approach to \(p\)-median location problems (Q1764773) (← links)
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
• An exact column-generation approach for the lot-type design problem (Q1979196) (← links)
• Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
• Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
• Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce (Q2419538) (← links)
• Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
• Dantzig-Wolfe decomposition for the facility location and production planning problem (Q2664417) (← links)
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
• Branch and price for large-scale capacitated hub location problems with single assignment (Q2899101) (← links)
• A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production (Q3005835) (← links)
• A study on the budget constrained facility location model considering inventory management cost (Q3166271) (← links)
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses (Q3502137) (← links)
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem (Q4656678) (← links)
• A branch-and-cut algorithm for the plant-cycle location problem (Q4661044) (← links)
• (Q4667441) (← links)
• A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
• The value of the multi-period solution revisited: when to model time in capacitated location problems (Q6065619) (← links)
• A logistics provider's profit maximization facility location problem with random utility maximizing followers (Q6568468) (← links)