Weak flow cover inequalities for the capacitated facility location problem

DOI10.1016/j.ejor.2020.07.033zbMath1487.90426OpenAlexW3044017125MaRDI QIDQ2029027

Sara Mattia, Pasquale Avella, Fabrizio Rossi, Maurizio Boccia

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.2020.07.033

zbMATH Keywords

facility locationvalid inequalitiesseparationflow covercut-and-branch

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Uses Software

• Mosel

Cites Work

• Unnamed Item
• Benders decomposition without separability: a computational study for capacitated facility location problems
• Facility location models for distribution system design
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A cutting plane algorithm for the capacitated facility location problem
• A branch-and-price algorithm for the capacitated facility location problem
• Valid inequalities and facets of the capacitated plant location problem
• Reformulation of capacitated facility location problems: How redundant information can help
• Capacitated facility location: Separation algorithms and computational experience
• A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem
• Xpress–Mosel
• Lower Bounds for the Capacitated Facility Location Problem Based on Column Generation
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• Capacitated Facility Location: Valid Inequalities and Facets
• Lifting, superadditivity, mixed integer rounding and single node flow sets revisited

This page was built for publication: Weak flow cover inequalities for the capacitated facility location problem