Separating lifted odd-hole inequalities to solve the index selection problem

DOI10.1016/S0166-218X(99)00050-5zbMath0967.90067OpenAlexW2015880537WikidataQ127172420 ScholiaQ127172420MaRDI QIDQ1304469

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

Publication date: 3 September 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00050-5

zbMATH Keywords

branch-and-cut algorithmset packing problemuncapacitated facility location problemclique inequalitiesChvátal-Gomory derivationindex selection problemlifted odd-hole inequalities

Mathematics Subject Classification ID

Searching and sorting (68P10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items

Fast separation for the three-index assignment problem, The index selection problem with configurations and memory limitation: a scatter search approach, On the membership problem for the \({0, 1/2}\)-closure, On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs, A branch-and-cut algorithm for the maximum cardinality stable set problem, Facility location models for distribution system design, A branch-and-cut algorithm for partition coloring

Uses Software

• OR-Library

Cites Work

• A projection method for the uncapacitated facility location problem
• On the exact solution of large-scale simple plant location problems
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
• The simple plant location problem: Survey and synthesis
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• A Dual-Based Procedure for Uncapacitated Facility Location
• Some facets of the simple plant location polytope
• A Primal Approach to the Simple Plant Location Problem
• On the Selection of an Optimal Set of Indexes
• Set Partitioning: A survey
• On the facial structure of set packing polyhedra
• Unnamed Item
• Unnamed Item