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

DOI10.1287/OPRE.23.1.150MaRDI QIDQ4096709zbMATH OpenOpenAlexFDO

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

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

Cited in

(12)

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

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)