A computational evaluation of a general branch-and-price framework for capacitated network location problems
From MaRDI portal
Publication:1026595
DOI10.1007/s10479-008-0375-5zbMath1172.90007OpenAlexW1970870385MaRDI QIDQ1026595
Alberto Ceselli, Giovanni Righini, Federico Liberatore
Publication date: 25 June 2009
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2434/5628
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (8)
Exactly solving a two-level location problem with modular node capacities ⋮ An implementation of exact knapsack separation ⋮ A cutting plane algorithm for the capacitated connected facility location problem ⋮ Modeling and solving profitable location and distribution problems ⋮ A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem ⋮ Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction ⋮ Random sampling and machine learning to understand good decompositions ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Facility location models for distribution system design
- Polyhedral analysis for concentrator location problems
- Solving the \(p\)-median problem with a semi-Lagrangian relaxation
- Computational study of large-scale \(p\)-median problems
- A comparison of two dual-based procedures for solving the p-median problem
- A note on solving large p-median problems
- Efficient algorithms for the capacitated concentrator location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- A tree search algorithm for the p-median problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Capacitated facility location: Separation algorithms and computational experience
- A model for the capacitated \(p\)-facility location problem in global environments
- Two exact algorithms for the capacitated \(p\)-median problem
- A column generation approach to capacitated \(p\)-median problems
- A branch-and-price approach to \(p\)-median location problems
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- A Linear Programming Approach to the Cutting-Stock Problem
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Cross Decomposition Algorithm for Capacitated Facility Location
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Dual-Based Procedure for Dynamic Facility Location
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- Capacitated service and regional constraints in location-allocation modeling
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
- A branch‐and‐price algorithm for the capacitated p‐median problem
- Validation of subgradient optimization
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- A new method for solving capacitated location problems based on a set partitioning approach
This page was built for publication: A computational evaluation of a general branch-and-price framework for capacitated network location problems
