An Integer Programming Formulation for the Maximum k-Subset Intersection Problem

DOI10.1007/978-3-319-09174-7_8zbMath1452.90219OpenAlexW2102461025MaRDI QIDQ3195319

Eduardo Candido Xavier, Alexandre S. Freire, Eduardo Theodoro Bogue, Cid Carvalho De Souza

Publication date: 16 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09174-7_8

zbMATH Keywords

integer programminggraspmaximum \(k\)-subset intersection

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on a maximum \(k\)-subset intersection problem
• Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
• Finding all closed sets: A general approach
• Finding Maximum Edge Bicliques in Convex Bipartite Graphs
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• A tutorial on branch and cut algorithms for the maximum stable set problem