Sparsity of integer formulations for binary programs
From MaRDI portal
Recommendations
- A mixed integer model for the sparsest cut problem
- A Survey of Different Integer Programming Formulations of the Travelling Salesman Problem
- Integer programming formulations for minimum spanning forests and connected components in sparse graphs
- Approximability of Sparse Integer Programs
- Exploiting sparsity for the min \(k\)-partition problem
Cites work
- A fast LU update for linear programming
- Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
- Approximating polyhedra with sparse inequalities
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Making sparse matrices sparser: Computational results
- Note on Hamilton Circuits
- On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
- Some lower bounds on sparse outer approximations of polytopes
- The complexity of cover inequality separation
Cited in
(7)- Integer-friendly formulations for the \(r\)-separation problem
- Strong IP formulations need large coefficients
- Sparse PSD approximation of the PSD cone
- Sparsity of integer solutions in the average case
- Polytopes associated with symmetry handling
- Representation of integers by sparse binary forms
- Ultra-small world detection in networks: subgraphs with prescribed distance distributions
This page was built for publication: Sparsity of integer formulations for binary programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294334)
