A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem

DOI10.1007/BF02568608zbMath0856.90064OpenAlexW1971944099MaRDI QIDQ1814816

Alberto Caprara, Juan-José Salazar-González

Publication date: 31 October 1996

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568608

zbMATH Keywords

set packingdatabase designuncapacitated facility locationindex selection problem

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items

The index selection problem with configurations and memory limitation: a scatter search approach, On a class of subadditive duals for the uncapacitated facility location problem, Fast bounding procedures for large instances of the simple plant location problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, Extreme points of discrete location polyhedra, A separation algorithm for the simple plant location problem, Separating lifted odd-hole inequalities to solve the index selection problem

Cites Work

• Unnamed Item
• Unnamed Item
• A projection method for the uncapacitated facility location problem
• Geometric algorithms and combinatorial optimization
• The simple plant location problem: Survey and synthesis
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• A Primal Approach to the Simple Plant Location Problem
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Set Partitioning: A survey
• On the facial structure of set packing polyhedra