A new extended formulation with valid inequalities for the capacitated concentrator location problem
From MaRDI portal
Publication:2029271
DOI10.1016/j.ejor.2019.07.008zbMath1487.90435OpenAlexW2960000661MaRDI QIDQ2029271
Massimo Di Francesco, Enrico Gorgone, Manlio Gaudioso, Ishwar Murthy
Publication date: 3 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.07.008
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Uses Software
Cites Work
- Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
- Polyhedral analysis for concentrator location problems
- Efficient algorithms for the capacitated concentrator location problem
- An algorithm for solving large capacitated warehouse location problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Locating concentrators in centralized computer networks
- Upper and lower bounds for the single source capacitated location problem.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- On the capacitated concentrator location problem: a reformulation by discretization
- A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
- Location Problems Arising in Computer Networks
- (1,k)-configurations and facets for packing problems
- A multiplier adjustment technique for the capacitated concentrator location problem
- INTEGER PROGRAMMING MODEL AND EXACT SOLUTION FOR CONCENTRATOR LOCATION PROBLEM
