:: Library Catalog

Copertina

Salvato in:

Dettagli Bibliografici
Autori principali:	Hojny, Christopher, Liberti, Leo
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control
Accesso online:	https://arxiv.org/abs/2605.02305
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Detecting and Handling Reflection Symmetries in Mixed-Integer (Nonlinear) Programming
di: Hojny, Christopher
Pubblicazione: (2024)

Unassigned distance geometry and the Buckminsterfullerene
di: Liberti, Leo
Pubblicazione: (2024)

A Framework for Handling and Exploiting Symmetry in Benders' Decomposition
di: Hojny, Christopher, et al.
Pubblicazione: (2025)

A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems
di: Secchin, Leonardo D., et al.
Pubblicazione: (2025)

Computational Aspects of Lifted Cover Inequalities for Knapsacks with Few Different Weights
di: Hojny, Christopher, et al.
Pubblicazione: (2024)

Branch-and-price strikes back for the k-vertex cut problem
di: Ciccarelli, Fabio, et al.
Pubblicazione: (2026)

A reformulation-enumeration MINLP algorithm for gas network design
di: Li, Yijiang, et al.
Pubblicazione: (2023)

Verifying message-passing neural networks via topology-based bounds tightening
di: Hojny, Christopher, et al.
Pubblicazione: (2024)

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

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

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

Distance geometry with and without the graph
di: Liberti, Leo, et al.
Pubblicazione: (2024)

A learning-based mathematical programming formulation for the automatic configuration of optimization solvers
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2024)

Capacity of Non-Separable Networks with Restricted Adversaries
di: Hojny, Christopher, et al.
Pubblicazione: (2026)

Relaxations for binary polynomial optimization via signed certificates
di: Xu, Liding, et al.
Pubblicazione: (2024)

Learning to Configure Mathematical Programming Solvers by Mathematical Programming
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2024)

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

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

Hardness of some optimization problems over correlation polyhedra
di: Caprara, Alberto, et al.
Pubblicazione: (2026)

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

The Algorithm Configuration Problem
di: Iommazzo, Gabriele, et al.
Pubblicazione: (2024)

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

On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem
di: Auricchio, Gennaro, et al.
Pubblicazione: (2025)

Parabolic Approximation & Relaxation for MINLP
di: Göß, Adrian, et al.
Pubblicazione: (2024)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)

State-of-the-art Methods for Pseudo-Boolean Solving with SCIP
di: Mexi, Gioni, et al.
Pubblicazione: (2025)

The sum of root-leaf distance interdiction problem with cardinality constraint by upgrading edges on trees
di: Li, Xiao, et al.
Pubblicazione: (2023)

A computationally efficient Benders decomposition for energy systems planning problems with detailed operations and time-coupling constraints
di: Jacobson, Anna, et al.
Pubblicazione: (2023)

Cutting planes for signomial programming
di: Xu, Liding, et al.
Pubblicazione: (2022)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
di: Sempere, Gregorio M., et al.
Pubblicazione: (2024)

Warm-starting outer approximation for parametrized convex MINLP
di: Tamm, Erik, et al.
Pubblicazione: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

An acceleration technique for methods for finding the nearest point in a polytope and computing the distance between two polytopes
di: Dolgopolik, M. V.
Pubblicazione: (2022)

Numerical computation of generalized Wasserstein distances with applications to traffic model analysis
di: Briani, Maya, et al.
Pubblicazione: (2024)

A comparison of formulations for aircraft deconfliction
di: Trindade, Renan Spencer, et al.
Pubblicazione: (2024)

A hierarchy of convex relaxations for the total variation distance
di: Lasserre, Jean-Bernard
Pubblicazione: (2024)

Weak optimal transport with moment constraints: constraint qualification, dual attainment and entropic regularization
di: Carlier, Guillaume, et al.
Pubblicazione: (2025)

A condensing approach for linear-quadratic optimization with geometric constraints
di: De Marchi, Alberto
Pubblicazione: (2025)

A feedback control approach to convex optimization with inequality constraints
di: Cerone, V., et al.
Pubblicazione: (2024)

A Nonmonotone Descent Method for Optimization Problems Defined by Upper-$\mathcal{C}^2 $ Functions over Submanifolds
di: Kanzow, Christian, et al.
Pubblicazione: (2026)