linear programming relaxation

Machine Learning for Cutting Planes in Integer Programming: A Survey IJCAI 2023 Approximation Algorithms for Socially Fair Clustering COLT 2021 Accelerated Message Passing for Entropy-Regularized MAP Inference ICML 2020 Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming NeurIPS 2020 Convergence Rates of Smooth Message Passing with Rounding in Entropy-Regularized MAP Inference AISTATS 2020 LP-SparseMAP: Differentiable Relaxed Optimization for Sparse Structured Prediction ICML 2020 Relative Interior Rule in Block-Coordinate Descent CVPR 2020 New Convex Relaxations for MRF Inference With Unknown Graphs ICCV 2019 Train and Test Tightness of LP Relaxations in Structured Prediction JMLR 2019 Optimal Submodular Extensions for Marginal Estimation AISTATS 2018 A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems CVPR 2017 A Message Passing Algorithm for the Minimum Cost Multicut Problem CVPR 2017 Conditions beyond treewidth for tightness of higher-order LP relaxations AISTATS 2017 Exact MAP Inference by Avoiding Fractional Vertices ICML 2017 Linear Relaxations for Finding Diverse Elements in Metric Spaces NeurIPS 2016 Pruning Random Forests for Prediction on a Budget NeurIPS 2016 Rounding-based Moves for Semi-Metric Labeling JMLR 2016 Tightness of LP Relaxations for Almost Balanced Models AISTATS 2016 Exactness of Approximate MAP Inference in Continuous MRFs NeurIPS 2015 Graph-Based Simplex Method for Pairwise Energy Minimization With Binary Variables CVPR 2015 Planar Ultrametrics for Image Segmentation NeurIPS 2015 Smooth and Strong: MAP Inference with Linear Convergence NeurIPS 2015 A Principled Approach for Coarse-to-Fine MAP Inference CVPR 2014 Globally Convergent Parallel MAP LP Relaxation Solver using the Frank-Wolfe Algorithm ICML 2014 Rounding-based Moves for Metric Labeling NeurIPS 2014