Cover Image

A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Secchin, Leonardo D., da Rocha, Wagner, da Rosa, Mariana, Liberti, Leo, Lavor, Carlile
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Parallel Newton methods for the continuous quadratic knapsack problem: A Jacobi and Gauss-Seidel tale
by: Secchin, Leonardo D., et al.
Published: (2026)

Unassigned distance geometry and the Buckminsterfullerene
by: Liberti, Leo
Published: (2024)

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

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

New Lagrangian dual algorithms for solving the continuous nonlinear resource allocation problem
by: Hu, Kaixiang, et al.
Published: (2024)

An Angle-Based Algorithmic Framework for the Interval Discretizable Distance Geometry Problem
by: da Rocha, Wagner A. A., et al.
Published: (2025)

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

On the local and global minimizers of the smooth stress function in Euclidean Distance Matrix problems
by: Song, Mengmeng, et al.
Published: (2024)

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

Relax-and-round strategies for solving the Unit Commitment problem with AC Power Flow constraints
by: Gómez, D., et al.
Published: (2025)

Towards a Linear-Ramp QAOA protocol: Evidence of a scaling advantage in solving some combinatorial optimization problems
by: Montanez-Barrera, J. A., et al.
Published: (2024)

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

The Algorithm Configuration Problem
by: Iommazzo, Gabriele, et al.
Published: (2024)

A matheuristic for solving the single row facility layout problem
by: Pammer, Thomas, et al.
Published: (2025)

A preconditioner for solving linear programming problems with dense columns
by: Villalba, Catalina J., et al.
Published: (2024)

A Primal-dual hybrid gradient method for solving optimal control problems and the corresponding Hamilton-Jacobi PDEs
by: Meng, Tingwei, et al.
Published: (2024)

A survey on combinatorial optimization
by: Le, Phuong
Published: (2024)

Parabolic optimal control problems with combinatorial switching constraints -- Part I: Convex relaxations
by: Buchheim, Christoph, et al.
Published: (2022)

High-level hybridization of heuristics and metaheuristics to solve symmetric TSP: a comparative study
by: Junior, Carlos Alberto da Silva, et al.
Published: (2024)

Sample-Cluster-Select: A new framework to obtain diverse approximate solutions of combinatorial optimization problems
by: Hashimoto, Susumu, et al.
Published: (2025)

An introduction to variational quantum algorithms for combinatorial optimization problems
by: Grange, Camille, et al.
Published: (2022)

Code generation for solving and differentiating through convex optimization problems
by: Schaller, Maximilian, et al.
Published: (2025)

Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm
by: Buchheim, Christoph, et al.
Published: (2024)

Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm
by: Buchheim, Christoph, et al.
Published: (2022)

Optimality of a refraction strategy in the optimal dividends problem with absolutely continuous controls subject to Parisian ruin
by: Locas, Félix, et al.
Published: (2023)

Formulations of the continuous set-covering problem on networks: a comparative study
by: Xu, Liding, et al.
Published: (2024)

A bilevel optiization based algorithm for solving a class of price equilibrium problems
by: Hai, Nguyen Ngoc, et al.
Published: (2024)

Concentration for random Euclidean combinatorial optimization
by: D'Achille, Matteo, et al.
Published: (2026)

Proximal bundle methods for hybrid weakly convex composite optimization problems
by: Liang, Jiaming, et al.
Published: (2023)

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

Feedback control solves pseudoconvex optimal tracking problems in nonlinear dynamical systems
by: Hu, Tingli, et al.
Published: (2025)

Proximal gradient descent on the smoothed duality gap to solve saddle point problems
by: Fercoq, Olivier
Published: (2025)

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
by: Schau, Quentin, et al.
Published: (2026)

Convergence guarantees for stochastic algorithms solving non-unique problems in metric spaces
by: Pischke, Nicholas, et al.
Published: (2026)

A new Simheuristics procedure for stochastic combinatorial optimization
by: Berkhout, Joost
Published: (2024)

An efficient algorithm for solving linear equality-constrained LQR problems
by: Sousa-Pinto, João, et al.
Published: (2024)

Linear ordinary differential equations constrained Gaussian Processes for solving optimal control problems
by: Besginow, Andreas, et al.
Published: (2025)

Numerical solving of an optimal control problem in large time horizon: the aerial vehicle guidance
by: Askovic, Veljko, et al.
Published: (2025)

A novel neural network with predefined-time stability for solving generalized monotone inclusion problems with applications
by: Van Tran, Nam
Published: (2026)