Imagen de Portada

Set System Approximation for Binary Integer Programs: Reformulations and Applications

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Wei, Ningji
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
por: Wei, Ningji, et al.
Publicado: (2025)

Convexoid: A Minimal Theory of Conjugate Convexity
por: Wei, Ningji
Publicado: (2024)

Mixed-Integer Reaggregated Hull Reformulation of Special Structured Generalized Linear Disjunctive Programs
por: Lee, Albert Joon, et al.
Publicado: (2026)

A Gauge Set Framework for Flexible Robustness Design
por: Wei, Ningji, et al.
Publicado: (2025)

Bilevel Mixed-Integer Linear Program with Binary Tender
por: Zhou, Bo, et al.
Publicado: (2025)

Mixed-Integer Linear Programming Approximations for the Stochastic Knapsack
por: Rossi, Roberto, et al.
Publicado: (2025)

Computing Approximate Nash Equilibria for Integer Programming Games
por: Duguet, Aloïs, et al.
Publicado: (2024)

Sharp-Peak Functions for Exactly Penalizing Binary Integer Programming
por: Zhou, Shenglong, et al.
Publicado: (2025)

Variable Aggregation-based Perspective Reformulation for Mixed-Integer Convex Optimization with Symmetry
por: Wu, Junhao, et al.
Publicado: (2026)

Reformulations of Quadratic Programs for Lipschitz Continuity
por: Agrawal, Devansh R., et al.
Publicado: (2025)

Computing Binary Integer Programming via A New Exact Penalty Function
por: Li, Shuai, et al.
Publicado: (2025)

Sharp Hybrid Zonotopes: Set Operations and the Reformulation-linearization Technique
por: Glunt, Jonah J., et al.
Publicado: (2025)

Complexity of Integer Programming in Reverse Convex Sets via Boundary Hyperplane Cover
por: Hildebrand, Robert, et al.
Publicado: (2024)

On the Convexification of a Class of Mixed-Integer Conic Sets
por: Du, Guxin, et al.
Publicado: (2025)

Sensitivity Analysis for Binary Outcome Misclassification in Randomization Tests via Integer Programming
por: Heng, Siyu, et al.
Publicado: (2022)

Enhancing Quadratic Programming Solvers via Quadratic Nonconvex Reformulation
por: Lu, Cheng, et al.
Publicado: (2025)

Exact Hull Reformulation for Quadratically Constrained Generalized Disjunctive Programs
por: Gusev, Sergey, et al.
Publicado: (2025)

On Integer Programs with Irrational Data
por: Hosseinian, Seyedmohammadhossein, et al.
Publicado: (2024)

On the Structure of Decision Diagram-Representable Mixed Integer Programs with Application to Unit Commitment
por: Salemi, Hosseinali, et al.
Publicado: (2022)

Clique Probing for Mixed-Integer Programs
por: von Holly-Ponientzietz, Jacob, et al.
Publicado: (2025)

A Gap Penalty Reformulation for Mathematical Programming with Complementarity Constraints: Convergence Analysis
por: Lin, Kangyu, et al.
Publicado: (2025)

Joint Binary-Continuous Fractional Programming: Solution Methods and Applications
por: Pham, Hoang Giang, et al.
Publicado: (2022)

Automating Idealness Proofs for Binary Programs with Application to Rectangle Packing
por: Fravel, Jamie, et al.
Publicado: (2024)

Sparsity-driven Aggregation of Mixed Integer Programs
por: Xu, Liding, et al.
Publicado: (2025)

Generator Subadditive Functions for Mixed-Integer Programs
por: Olivares, Gustavo Ivan Angulo, et al.
Publicado: (2024)

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

Conic Reformulations for Kullback-Leibler Divergence Constrained Distributionally Robust Optimization and Applications
por: Kocuk, Burak
Publicado: (2020)

Optimizing Weak Orders via Integer Linear Programming
por: Aledo, Juan A., et al.
Publicado: (2025)

Cut-based Conflict Analysis in Mixed Integer Programming
por: Mexi, Gioni, et al.
Publicado: (2024)

An Integer Programming Formulation for the Maximally Diverse Grouping Problem
por: Lam, Kevin Fu Yuan, et al.
Publicado: (2024)

Approximating the Gomory Mixed-Integer Cut Closure Using Historical Data
por: Becu, Berkay, et al.
Publicado: (2024)

Over-Approximating Minimizer Sets of Constrained Convex Programs with Parametric Uncertainty via Reachability Analysis
por: Gould, Brendan, et al.
Publicado: (2026)

Input Regularization for Integer Optimal Control in BV with Applications to Control of Poroelastic and Poroviscoelastic Systems
por: Bociu, Lorena, et al.
Publicado: (2022)

Approximate Dynamic Programming for a Remanufacture-to-Order System
por: Pashapour, Amirreza, et al.
Publicado: (2025)

Day-Ahead Offering for Virtual Power Plants: A Stochastic Linear Programming Reformulation and Projected Subgradient Method
por: Meng, Weiqi, et al.
Publicado: (2026)

A Hybrid Perspective on Suboptimal Mixed-Integer Quadratic Programming
por: Fina, Luke, et al.
Publicado: (2025)

Acceleration Techniques for Learning Optimal Classification Trees with Integer Programming
por: Keegan, Mitchell, et al.
Publicado: (2025)

Lagrangian Duality for Mixed-Integer Semidefinite Programming: Theory and Algorithms
por: de Meijer, Frank, et al.
Publicado: (2025)

Decomposition Methods for Global Solutions of Mixed-Integer Linear Programs
por: Sun, Kaizhao, et al.
Publicado: (2021)

On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming
por: Deng, Haoyun, et al.
Publicado: (2024)