A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem

DOI10.1287/opre.23.1.150zbMath0331.90043OpenAlexW2046723224MaRDI QIDQ4096709

Jamie J. Goode, Mokhtar S. Bazaraa

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.1.150

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Quadratic programming (90C20) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (12)

A Branch-and-Bound Algorithm for Team Formation on Social Networks ⋮ On a linearization technique for solving the quadratic set covering problem and variations ⋮ Relation between set partitioning and set covering problems with quadratic fractional objective functions ⋮ A Linearization technique for solving the quadratic set covering problem ⋮ Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows ⋮ Combinatorial optimization with interaction costs: complexity and solvable cases ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ An exact penalty function approach for nonlinear integer programming problems ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Cluster generation and grouping using mathematical programming ⋮ AUGMENTED LAGRANGEAN RELAXATIONS IN GENERAL MIXED INTEGER PROGRAMMING ⋮ Linearization approach to multi objective set covering problem with imprecise nonlinear fractional objectives

This page was built for publication: A Cutting-Plane Algorithm for the Quadratic Set-Covering Problem