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

DOI10.1287/OPRE.23.1.150zbMATH Open0331.90043OpenAlexW2046723224MaRDI QIDQ4096709FDOQ4096709

Authors: 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

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

Cited In (12)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4096709)