An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
From MaRDI portal
Publication:3195319
DOI10.1007/978-3-319-09174-7_8zbMATH Open1452.90219OpenAlexW2102461025MaRDI QIDQ3195319FDOQ3195319
Authors: Eduardo Theodoro Bogue, Eduardo C. Xavier, Alexandre S. Freire, 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
Recommendations
- A note on a maximum \(k\)-subset intersection problem
- The maximum feasible subset problem (maxFS) and applications
- scientific article; zbMATH DE number 3847217
- Approximation algorithm and its performance for maximizing submodular function subject to matroid intersection
- Mixed-integer programming techniques for the connected max-\(k\)-cut problem
- On maximizing monotone or non-monotone \(k\)-submodular functions with the intersection of knapsack and matroid constraints
- Integer programming formulations for the minimum weighted maximal matching problem
- A mixed integer linear programming formulation of the maximum betweenness problem
- Optimization problems for the maximum \(k\)-plex
- A linear programming formulation for the maximum complete multipartite subgraph problem
Cites Work
- Title not available (Why is that?)
- A tutorial on branch and cut algorithms for the maximum stable set problem
- Title not available (Why is that?)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A note on a maximum \(k\)-subset intersection problem
- Finding maximum edge bicliques in convex bipartite graphs
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Finding all closed sets: A general approach
Cited In (3)
This page was built for publication: An Integer Programming Formulation for the Maximum k-Subset Intersection Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3195319)
