Cover Image

MIP Relaxations in Factorable Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	He, Taotao, Tawarmalani, Mohit
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Discreteness to Convexity: Promotion Planning via Simplotope Triangulation
by: He, Taotao, et al.
Published: (2024)

Convexification Techniques for Fractional Programs
by: He, Taotao, et al.
Published: (2023)

Axis-Aligned Relaxations for Mixed-Integer Nonlinear Programming
by: Zhu, Haisheng, et al.
Published: (2026)

Minimizing risk measures with applications in network traffic engineering
by: Chandra, Ashish, et al.
Published: (2025)

On MIP Formulations for Logit-Based Multi-Purchase Choice Models and Applications
by: He, Taotao, et al.
Published: (2026)

Minimum reflux calculation for multicomponent distillation in multi-feed, multi-product columns: Algorithms and examples
by: Jiang, Zheyu, et al.
Published: (2025)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

A Hybrid Relaxation-Heuristic Framework for Solving MIP with Binary Variables
by: Wang, Zayn
Published: (2026)

MIP-DD: A Delta Debugger for Mixed Integer Programming Solvers
by: Hoen, Alexander, et al.
Published: (2024)

Certifying MIP-based Presolve Reductions for 0-1 Integer Linear Programs
by: Hoen, Alexander, et al.
Published: (2024)

Improving the Solution of Indefinite Quadratic Programs and Linear Programs with Complementarity Constraints by a Progressive MIP Method
by: Zhang, Xinyao, et al.
Published: (2024)

QUBO Formulations for MIP Symmetry Detection
by: While, Alexander, et al.
Published: (2025)

Assortment Optimization Under History-Dependent Effects
by: He, Taotao, et al.
Published: (2024)

Optimal Data Reduction under Information-Theoretic Criteria
by: He, Taotao, et al.
Published: (2025)

Inverse of the Gomory Corner Relaxation of Integer Programs
by: Lyu, George, et al.
Published: (2024)

BenLOC: A Benchmark for Learning to Configure MIP Optimizers
by: Li, Hongpei, et al.
Published: (2025)

Tight MIP Formulations for Optimal Operation and Investment of Storage Including Reserves
by: Elgersma, Maaike B., et al.
Published: (2024)

Polynomial Optimization Relaxations for Generalized Semi-Infinite Programs
by: Hu, Xiaomeng, et al.
Published: (2023)

Exactness of the DNN Relaxation for Random Standard Quadratic Programs
by: Chen, Xin
Published: (2026)

Learning to Relax Nonconvex Quadratically Constrained Quadratic Programs
by: Dedeoglu, Muge, et al.
Published: (2025)

Sparse Sub-gaussian Random Projections for Semidefinite Programming Relaxations
by: Guedes-Ayala, Monse, et al.
Published: (2024)

Certified Constraint Propagation and Dual Proof Analysis in a Numerically Exact MIP Solver
by: Borst, Sander, et al.
Published: (2024)

An integer programming approach for quick-commerce assortment planning
by: Chen, Yajing, et al.
Published: (2024)

Tilt Stability for Nonlinear Programs under Relaxed Constant Rank Constraint Qualification
by: Chieu, Nguyen Huy, et al.
Published: (2025)

Batched First-Order Methods for Parallel LP Solving in MIP
by: Blin, Nicolas, et al.
Published: (2026)

Regularized MIP Model for Integrating Energy Storage Systems and its Application for Solving a Trilevel Interdiction Problem
by: Han, Dahye, et al.
Published: (2024)

Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization
by: Masiha, Saeed, et al.
Published: (2025)

A general framework for providing interval representations of Pareto optimal outcomes for large-scale bi- and tri-criteria MIP problems
by: Filcek, Grzegorz, et al.
Published: (2023)

RiNNAL+: a Riemannian ALM Solver for SDP-RLT Relaxations of Mixed-Binary Quadratic Programs
by: Hou, Di, et al.
Published: (2025)

Exponential Conic Relaxations for Signomial Geometric Programming
by: Filabadi, Milad Dehghani, et al.
Published: (2024)

An analytic framework for the multiplicative best-worst method
by: Ratandhara, Harshit, et al.
Published: (2023)

Taxicab distance based best-worst method for multi-criteria decision-making: An analytical approach
by: Ratandhara, Harshit, et al.
Published: (2024)

Centering ADMM for the Semidefinite Relaxation of the QAP
by: Kanoh, Shin-ichi, et al.
Published: (2020)

On the Strength of Linear Relaxations in Ordered Optimization
by: Blanco, Víctor, et al.
Published: (2025)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

Relaxation methods for pessimistic bilevel optimization
by: Benchouk, Imane, et al.
Published: (2024)

Accurate Linear Cutting-Plane Relaxations for ACOPF
by: Bienstock, Daniel, et al.
Published: (2023)

Should We Relax Stability in Matching Markets?
by: Bertsimas, Dimitris, et al.
Published: (2025)

An α-cut intervals based fuzzy best-Worst method for Multi-Criteria Decision-Making
by: Ratandhara, Harshit M, et al.
Published: (2023)

An Analytical Framework for the Linear Best-Worst Method and its Application to Achieve Sustainable Development Goals--Oriented Agri-Food Supply Chains
by: Ratandhara, Harshit M., et al.
Published: (2025)