A branch-and-price algorithm for the capacitated facility location problem
From MaRDI portal
Recommendations
- A branch-and-price algorithm for facility location with general facility cost functions
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- Branch-and-cut-and-price for capacitated connected facility location
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Branch-and-bound algorithm for a competitive facility location problem
- A branch-and-price algorithm for the ring-tree facility location problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- A Branch-and-Cut method for the Capacitated Location-Routing Problem
Cites work
- scientific article; zbMATH DE number 1816804 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- scientific article; zbMATH DE number 1303535 (Why is no real title available?)
- scientific article; zbMATH DE number 1062478 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- scientific article; zbMATH DE number 949665 (Why is no real title available?)
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Computational Study of Search Strategies for Mixed Integer Programming
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A Linear Programming Approach to the Cutting-Stock Problem
- A branch-and-price approach to p-median location problems
- A column generation approach to capacitated \(p\)-median problems
- A comparison of heuristics and relaxations for the capacitated plant location problem
- ADD-heuristics' starting procedures for capacitated plant location models
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- An algorithm for solving large capacitated warehouse location problems
- An efficient heuristic procedure for the capacitated warehouse location problem
- An efficient tabu search procedure for the \(p\)-median problem
- An interior point method in Dantzig-Wolfe decomposition
- Approximate solutions to large scale capacitated facility location problems
- Branch-and-price: Column generation for solving huge integer programs
- Branching rules revisited
- Capacitated Facility Location: Valid Inequalities and Facets
- Capacitated facility location: Separation algorithms and computational experience
- Decomposition Principle for Linear Programs
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Dominance Criteria for the Capacitated Warehouse Location Problem
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Efficient algorithms for the capacitated concentrator location problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Facility location models for planning a transatlantic communications network
- Heuristics for the capacitated plant location model
- Lagrangean heuristics for location problems
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Location Problems Arising in Computer Networks
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- On constrained optimization by adjoint based quasi-Newton methods
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Stabilized column generation
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- The Decomposition Algorithm for Linear Programs
- Upper and lower bounds for the single source capacitated location problem.
- Using central prices in the decomposition of linear programs
- Valid inequalities and facets of the capacitated plant location problem
Cited in
(38)- Solving the facility location and fixed charge solid transportation problem
- Revisiting Lagrangian relaxation for network design
- A logistics provider's profit maximization facility location problem with random utility maximizing followers
- The capacitated mobile facility location problem
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- Capacitated location model with online demand pooling in a multi-channel supply chain
- Branch-and-price and constraint programming for solving a real-life technician dispatching problem
- Weak flow cover inequalities for the capacitated facility location problem
- A fast exact method for the capacitated facility location problem with differentiable convex production costs
- A branch-and-cut algorithm for the plant-cycle location problem
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem
- A profit-maximization location-routing-pricing problem: a branch-and-price algorithm
- A cutting plane algorithm for the capacitated facility location problem
- Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
- Lower and upper bounds for a capacitated plant location problem with multicommodity flow
- The value of the multi-period solution revisited: when to model time in capacitated location problems
- Benders decomposition without separability: a computational study for capacitated facility location problems
- Practical techniques to solve capacitated facility location problem
- Dantzig-Wolfe decomposition for the facility location and production planning problem
- Dynamic mean value cross decomposition algorithm for capacitated facility location problems
- Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks
- scientific article; zbMATH DE number 2159470 (Why is no real title available?)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
- A column generation heuristic for optimal wireless sensor network design with mobile sinks
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production
- A study on the budget constrained facility location model considering inventory management cost
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- A hybrid firefly-genetic algorithm for the capacitated facility location problem
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- A branch-and-price approach to p-median location problems
- A bi-objective approach to discrete cost-bottleneck location problems
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- An exact column-generation approach for the lot-type design problem
- scientific article; zbMATH DE number 764450 (Why is no real title available?)
- Branch and price for large-scale capacitated hub location problems with single assignment
- Variations in the flow approach to CFCLP-TC for multiobjective supply chain design
This page was built for publication: A branch-and-price algorithm for the capacitated facility location problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q864031)
