Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
From MaRDI portal
Publication:5219296
DOI10.1287/moor.2017.0866zbMath1432.90090arXiv1601.00198OpenAlexW2963926915MaRDI QIDQ5219296
Qianyi Wang, Marco Molinaro, Santanu S. Dey
Publication date: 11 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1601.00198
Related Items (13)
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables ⋮ Decomposition Branching for Mixed Integer Programming ⋮ Branch-and-bound solves random binary IPs in poly\((n)\)-time ⋮ Split cuts from sparse disjunctions ⋮ Average-case complexity of a branch-and-bound algorithm for \textsc{Min Dominating Set} ⋮ Improving the Randomization Step in Feasibility Pump ⋮ Strong IP formulations need large coefficients ⋮ Sparsity of integer formulations for binary programs ⋮ Optimization-Driven Scenario Grouping ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II ⋮ New SOCP relaxation and branching rule for bipartite bilinear programs ⋮ Distributed Stochastic Optimization with Large Delays ⋮ Sparse PSD approximation of the PSD cone
Cites Work
- Cutting planes in integer and mixed integer programming
- Approximating polyhedra with sparse inequalities
- On the ratio of optimal integral and fractional covers
- Dual decomposition in stochastic integer programming
- Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation
- Incidence matrices and interval graphs
- A factor \(\frac {1}{2}\) approximation algorithm for two-stage stochastic matching problems
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- A Fractional Analogue of Brooks' Theorem
- On the Practical Strength of Two-Row Tableau Cuts
- Partial Convexification of General MIPs by Dantzig-Wolfe Reformulation
- Mixed Integer Programming Computation
- The Group-Theoretic Approach in Mixed Integer Programming
- Solving Large-Scale Zero-One Linear Programming Problems
- Decomposing Matrices into Blocks
- A Recursive Bipartitioning Algorithm for Permuting Sparse Square Matrices into Block Diagonal Form with Overlap
- Computational Experience with Hypergraph-Based Methods for Automatic Decomposition in Discrete Optimization
- Sparsity of Lift-and-Project Cutting Planes
- Finitely Convergent Decomposition Algorithms for Two-Stage Stochastic Pure Integer Programs
- Strengthened Benders Cuts for Stochastic Integer Programs with Continuous Recourse
- Graph colouring and the probabilistic method
This page was built for publication: Analysis of Sparse Cutting Planes for Sparse MILPs with Applications to Stochastic MILPs
