A branch-and-price algorithm for the capacitated facility location problem
From MaRDI portal
Publication:864031
DOI10.1016/j.ejor.2005.03.078zbMath1163.90607OpenAlexW1985089902MaRDI QIDQ864031
Publication date: 12 February 2007
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.03.078
column generationbranch-and-pricemixed-integer programmingcapacitated facility locationlagrangean relaxation
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (25)
A bi-objective approach to discrete cost-bottleneck location problems ⋮ A study on the budget constrained facility location model considering inventory management cost ⋮ A cutting plane algorithm for the capacitated facility location problem ⋮ A Branch-and-Price Algorithm for the Multiple Knapsack Problem ⋮ Benders decomposition without separability: a computational study for capacitated facility location problems ⋮ Combining simulated annealing with Lagrangian relaxation and weighted Dantzig-Wolfe decomposition for integrated design decisions in wireless sensor networks ⋮ Dantzig-Wolfe decomposition for the facility location and production planning problem ⋮ Revisiting Lagrangian relaxation for network design ⋮ Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce ⋮ The value of the multi-period solution revisited: when to model time in capacitated location problems ⋮ Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses ⋮ Variations in the flow approach to CFCLP-TC for multiobjective supply chain design ⋮ The capacitated mobile facility location problem ⋮ An exact column-generation approach for the lot-type design problem ⋮ A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous-casting production ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A hybrid firefly-genetic algorithm for the capacitated facility location problem ⋮ A column generation heuristic for optimal wireless sensor network design with mobile sinks ⋮ Weak flow cover inequalities for the capacitated facility location problem ⋮ Capacitated location model with online demand pooling in a multi-channel supply chain ⋮ A fast exact method for the capacitated facility location problem with differentiable convex production costs ⋮ Lower and upper bounds for a two-stage capacitated facility location problem with handling costs ⋮ A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem ⋮ Lower and upper bounds for a capacitated plant location problem with multicommodity flow
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Using central prices in the decomposition of linear programs
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Approximate solutions to large scale capacitated facility location problems
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- Efficient algorithms for the capacitated concentrator location problem
- An algorithm for solving large capacitated warehouse location problems
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Facility location models for planning a transatlantic communications network
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Valid inequalities and facets of the capacitated plant location problem
- An efficient tabu search procedure for the \(p\)-median problem
- Capacitated facility location: Separation algorithms and computational experience
- Stabilized column generation
- An interior point method in Dantzig-Wolfe decomposition
- Upper and lower bounds for the single source capacitated location problem.
- A column generation approach to capacitated \(p\)-median problems
- A branch-and-price approach to \(p\)-median location problems
- Lagrangean heuristics for location problems
- Branching rules revisited
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Dominance Criteria for the Capacitated Warehouse Location Problem
- Decomposition Principle for Linear Programs
- A Linear Programming Approach to the Cutting-Stock Problem
- The Decomposition Algorithm for Linear Programs
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Location Problems Arising in Computer Networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- An efficient heuristic procedure for the capacitated warehouse location problem
- The B<scp>oxstep</scp> Method for Large-Scale Optimization
- An Improved Algorithm for the Capacitated Facility Location Problem
- On constrained optimization by adjoint based quasi-Newton methods
- A Computational Study of Search Strategies for Mixed Integer Programming
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Capacitated Facility Location: Valid Inequalities and Facets
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
This page was built for publication: A branch-and-price algorithm for the capacitated facility location problem
