Cover Image

A reformulation-enumeration MINLP algorithm for gas network design

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Yijiang, Dey, Santanu S., Sahinidis, Nikolaos V.
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

Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
by: Bayramoğlu, Selin, et al.
Published: (2026)

A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
by: Pacheco, Bruno Machado, et al.
Published: (2025)

Constructing Tight Quadratic Relaxations for Global Optimization: II. Underestimating Difference-of-Convex (D.C.) Functions
by: Strahl, William R., et al.
Published: (2024)

Constructing Tight Quadratic Relaxations for Global Optimization: I. Outer-Approximating Twice-Differentiable Convex Functions
by: Strahl, William R., et al.
Published: (2024)

A second-order cone representable class of nonconvex quadratic programs
by: Dey, Santanu S., et al.
Published: (2025)

A computational comparison of handling distance constraints in MINLP
by: Hojny, Christopher, et al.
Published: (2026)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
by: Zhou, Junpeng, et al.
Published: (2023)

Improving Full Strong Branching Decisions by Incorporating Additional Information
by: Shah, Prachi, et al.
Published: (2025)

Convexification of a Separable Function over a Polyhedral Ground Set
by: Dey, Santanu S., et al.
Published: (2025)

Asymptotically tight Lagrangian dual of smooth nonconvex problems via improved error bound of Shapley-Folkman Lemma
by: Dey, Santanu S, et al.
Published: (2026)

A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
by: Peng, Zedong, et al.
Published: (2024)

On Sparse Canonical Correlation Analysis
by: Li, Yongchun, et al.
Published: (2023)

New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)

A two-stage stochastic MINLP model to design and operate a multi-energy microgrid by addressing carbon emission regulatory policies uncertainty
by: Akülker, Handan, et al.
Published: (2025)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Sensitivity analysis for mixed binary quadratic programming
by: Cifuentes, Diego, et al.
Published: (2023)

Extreme Strong Branching for QCQPs
by: Dey, Santanu S., et al.
Published: (2025)

Probabilistic analysis of dual decomposition on two-stage stochastic integer programs
by: Dey, Santanu S., et al.
Published: (2026)

Non-Monotonicity of Branching Rules with respect to Linear Relaxations
by: Shah, Prachi, et al.
Published: (2024)

Aggregation of Bilinear Bipartite Equality Constraints and its Application to Structural Model Updating Problem
by: Dey, Santanu S, et al.
Published: (2024)

Lagrangian dual with zero duality gap that admits decomposition
by: Cifuentes, Diego, et al.
Published: (2024)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
by: Lu, Cheng, et al.
Published: (2026)

Fast algorithm for sparse least trimmed squares via trimmed-regularized reformulation
by: Yagishita, Shotaro
Published: (2024)

MINLP-based hybrid strategy for operating mode selection of TES-backed-up refrigeration systems
by: Bejarano, G., et al.
Published: (2024)

Branching with a pre-specified finite list of $k$-sparse split sets for binary MILPs
by: Dey, Santanu S., et al.
Published: (2024)

A Comparative Study of MINLP and MPVC Formulations for Solving Complex Nonlinear Decision-Making Problems in Aerospace Applications
by: Ghezzi, Andrea, et al.
Published: (2025)

Theoretical and numerical comparison of seven single-level reformulations for bilevel programs
by: Li, Yu-Wei, et al.
Published: (2025)

MIQCQP reformulation of the ReLU neural networks Lipschitz constant estimation problem
by: Sbihi, Mohammed, et al.
Published: (2024)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
by: Klädtke, Manuel, et al.
Published: (2023)

Strengthening Dual Bounds for Multicommodity Capacitated Network Design with Unsplittable Flow Constraints
by: Greening, Lacy M., et al.
Published: (2025)

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

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

Optimality conditions for bilevel programs via Moreau envelope reformulation
by: Bai, Kuang, et al.
Published: (2023)

On Solving General and Special Structure Medium-Scale MINLP Problems
by: Bagherpour, Negin, et al.
Published: (2023)

Mixed-Integer Programming for Change-point Detection
by: Narula, Apoorva, et al.
Published: (2026)

CoNeT-GIANT: A compressed Newton-type fully distributed optimization algorithm
by: Das, Souvik, et al.
Published: (2025)

Chvátal-Gomory Rounding of Eigenvector Inequalities for QCQPs
by: Dey, Santanu S., et al.
Published: (2026)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
by: Chaouach, Lotfi M., et al.
Published: (2025)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
by: Marshall, Luke, et al.
Published: (2026)