A computational comparison of handling distance constraints in MINLP
Fuente:
arXiv
Saved in:
| Main Authors: | Hojny, Christopher, Liberti, Leo |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Detecting and Handling Reflection Symmetries in Mixed-Integer (Nonlinear) Programming
by: Hojny, Christopher
Published: (2024)
by: Hojny, Christopher
Published: (2024)
Unassigned distance geometry and the Buckminsterfullerene
by: Liberti, Leo
Published: (2024)
by: Liberti, Leo
Published: (2024)
A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems
by: Secchin, Leonardo D., et al.
Published: (2025)
by: Secchin, Leonardo D., et al.
Published: (2025)
A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
by: Hojny, Christopher, et al.
Published: (2025)
by: Hojny, Christopher, et al.
Published: (2025)
Branch-and-price strikes back for the k-vertex cut problem
by: Ciccarelli, Fabio, et al.
Published: (2026)
by: Ciccarelli, Fabio, et al.
Published: (2026)
Computational Aspects of Lifted Cover Inequalities for Knapsacks with Few Different Weights
by: Hojny, Christopher, et al.
Published: (2024)
by: Hojny, Christopher, et al.
Published: (2024)
A reformulation-enumeration MINLP algorithm for gas network design
by: Li, Yijiang, et al.
Published: (2023)
by: Li, Yijiang, et al.
Published: (2023)
A relax-fix-and-exclude algorithm for an MINLP problem with multilinear interpolations
by: Pacheco, Bruno Machado, et al.
Published: (2025)
by: Pacheco, Bruno Machado, et al.
Published: (2025)
A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
by: Peng, Zedong, et al.
Published: (2024)
by: Peng, Zedong, et al.
Published: (2024)
New Outer Approximation Algorithms for Nonsmooth Convex MINLP Problems
by: Wei, Zhou, et al.
Published: (2026)
by: Wei, Zhou, et al.
Published: (2026)
Verifying message-passing neural networks via topology-based bounds tightening
by: Hojny, Christopher, et al.
Published: (2024)
by: Hojny, Christopher, et al.
Published: (2024)
A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
by: Iommazzo, Gabriele, et al.
Published: (2024)
by: Iommazzo, Gabriele, et al.
Published: (2024)
Capacity of Non-Separable Networks with Restricted Adversaries
by: Hojny, Christopher, et al.
Published: (2026)
by: Hojny, Christopher, et al.
Published: (2026)
MINLP-based hybrid strategy for operating mode selection of TES-backed-up refrigeration systems
by: Bejarano, G., et al.
Published: (2024)
by: Bejarano, G., 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)
by: Ghezzi, Andrea, et al.
Published: (2025)
Distance geometry with and without the graph
by: Liberti, Leo, et al.
Published: (2024)
by: Liberti, Leo, et al.
Published: (2024)
Learning to Configure Mathematical Programming Solvers by Mathematical Programming
by: Iommazzo, Gabriele, et al.
Published: (2024)
by: Iommazzo, Gabriele, et al.
Published: (2024)
Relaxations for binary polynomial optimization via signed certificates
by: Xu, Liding, et al.
Published: (2024)
by: Xu, Liding, et al.
Published: (2024)
On Solving General and Special Structure Medium-Scale MINLP Problems
by: Bagherpour, Negin, et al.
Published: (2023)
by: Bagherpour, Negin, et al.
Published: (2023)
Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)
by: Caprara, Alberto, et al.
Published: (2026)
On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem
by: Auricchio, Gennaro, et al.
Published: (2025)
by: Auricchio, Gennaro, et al.
Published: (2025)
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)
by: Akülker, Handan, et al.
Published: (2025)
The Algorithm Configuration Problem
by: Iommazzo, Gabriele, et al.
Published: (2024)
by: Iommazzo, Gabriele, et al.
Published: (2024)
The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
by: Li, Xiao, et al.
Published: (2023)
by: Li, Xiao, et al.
Published: (2023)
A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints
by: Jacobson, Anna, et al.
Published: (2023)
by: Jacobson, Anna, et al.
Published: (2023)
Parabolic Approximation & Relaxation for MINLP
by: Göß, Adrian, et al.
Published: (2024)
by: Göß, Adrian, et al.
Published: (2024)
State-of-the-art Methods for Pseudo-Boolean Solving with SCIP
by: Mexi, Gioni, et al.
Published: (2025)
by: Mexi, Gioni, et al.
Published: (2025)
An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
by: Sempere, Gregorio M., et al.
Published: (2024)
by: Sempere, Gregorio M., et al.
Published: (2024)
An extension of an RLT-based solver to MINLP polynomial problems
by: González-Díaz, Julio, et al.
Published: (2024)
by: González-Díaz, Julio, et al.
Published: (2024)
A comparison of formulations for aircraft deconfliction
by: Trindade, Renan Spencer, et al.
Published: (2024)
by: Trindade, Renan Spencer, et al.
Published: (2024)
A hierarchy of convex relaxations for the total variation distance
by: Lasserre, Jean-Bernard
Published: (2024)
by: Lasserre, Jean-Bernard
Published: (2024)
Weak optimal transport with moment constraints: constraint qualification, dual attainment and entropic regularization
by: Carlier, Guillaume, et al.
Published: (2025)
by: Carlier, Guillaume, et al.
Published: (2025)
An acceleration technique for methods for finding the nearest point in a polytope and computing the distance between two polytopes
by: Dolgopolik, M. V.
Published: (2022)
by: Dolgopolik, M. V.
Published: (2022)
A condensing approach for linear-quadratic optimization with geometric constraints
by: De Marchi, Alberto
Published: (2025)
by: De Marchi, Alberto
Published: (2025)
A feedback control approach to convex optimization with inequality constraints
by: Cerone, V., et al.
Published: (2024)
by: Cerone, V., et al.
Published: (2024)
Numerical computation of generalized Wasserstein distances with applications to traffic model analysis
by: Briani, Maya, et al.
Published: (2024)
by: Briani, Maya, et al.
Published: (2024)
Warm-starting outer approximation for parametrized convex MINLP
by: Tamm, Erik, et al.
Published: (2025)
by: Tamm, Erik, et al.
Published: (2025)
Discrete lossless convexification for pointing constraints
by: Luo, Dayou, et al.
Published: (2025)
by: Luo, Dayou, et al.
Published: (2025)
Cutting planes for signomial programming
by: Xu, Liding, et al.
Published: (2022)
by: Xu, Liding, et al.
Published: (2022)
A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds
by: Kanzow, Christian, et al.
Published: (2026)
by: Kanzow, Christian, et al.
Published: (2026)
Similar Items
-
Detecting and Handling Reflection Symmetries in Mixed-Integer (Nonlinear) Programming
by: Hojny, Christopher
Published: (2024) -
Unassigned distance geometry and the Buckminsterfullerene
by: Liberti, Leo
Published: (2024) -
A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems
by: Secchin, Leonardo D., et al.
Published: (2025) -
A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
by: Hojny, Christopher, et al.
Published: (2025) -
Branch-and-price strikes back for the k-vertex cut problem
by: Ciccarelli, Fabio, et al.
Published: (2026)