The double-assignment plant location problem with co-location

DOI10.1016/j.cor.2020.105059OpenAlexW3046027902MaRDI QIDQ2026959

Alfredo Marín, Mercedes Pelegrín

Publication date: 21 May 2021

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2020.105059

zbMATH Keywords

set packingdiscrete locationclique facetsseparation heuristic

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Discrete location and assignment (90B80)

Related Items (2)

Discrete facility location in machine learning ⋮ New variants of the simple plant location problem and applications

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
• The simple plant location problem: Survey and synthesis
• On the facets of the simple plant location packing polytope
• Capacitated facility location problem with general setup cost
• A strengthened formulation for the simple plant location problem with order
• Reliable Facility Location Design Under the Risk of Disruptions
• Projecting the flow variables for hub location problems
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• A Plant and Warehouse Location Problem
• Fault-tolerant facility location
• On the facial structure of set packing polyhedra
• Location Science
• Multi-Dimensional Location Problems

This page was built for publication: The double-assignment plant location problem with co-location