Cover Image

Branch and Cut for Partitioning a Graph into a Cycle of Clusters

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Eifler, Leon, Witzig, Jakob, Gleixner, Ambros
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 65K05, 90C11, 60-xx
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

Mixed-integer linearity in nonlinear optimization: a trust region approach
by: De Marchi, Alberto
Published: (2023)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
by: Deng, Kangkang, et al.
Published: (2024)

New finite relaxation hierarchies for concavo-convex, disjoint bilinear programs, and facial disjunctions
by: Tawarmalani, Mohit
Published: (2024)

Hybrid optimal control with mixed-integer Lagrangian methods
by: Nikitina, Viktoriya, et al.
Published: (2024)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
by: De Marchi, Alberto
Published: (2024)

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

Strong Partitioning and a Machine Learning Approximation for Accelerating the Global Optimization of Nonconvex QCQPs
by: Kannan, Rohit, et al.
Published: (2022)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
by: Bestuzheva, Ksenia, et al.
Published: (2022)

Steiner Cut Dominants
by: Conforti, Michele, et al.
Published: (2022)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
by: Halbig, Katrin, et al.
Published: (2024)

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
by: Zhou, Juan, et al.
Published: (2024)

The SCIP Optimization Suite 9.0
by: Bolusani, Suresh, et al.
Published: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
by: Zhang, Chenyu, et al.
Published: (2023)

The SCIP Optimization Suite 10.0
by: Hojny, Christopher, et al.
Published: (2025)

Monomial barrier functions for the box-constrained convex optimization problems
by: Fayed, Hatem
Published: (2024)

Stochastic optimization over proximally smooth sets
by: Davis, Damek, et al.
Published: (2020)

On Solution Uniqueness and Robust Recovery for Sparse Regularization with a Gauge: from Dual Point of View
by: He, Jiahuan, et al.
Published: (2023)

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
by: Gfrerer, H.
Published: (2024)

A Representation Optimization Dichotomy, Lie-Algebraic Policy Optimization
by: KC, Sooraj, et al.
Published: (2026)

Nonlinear Derivative-free Constrained Optimization with a Penalty-Interior Point Method and Direct Search
by: Brilli, Andrea, et al.
Published: (2024)

$Q$-fully Quadratic Modeling and its Application in a Random Subspace Derivative-free Method
by: Chen, Yiwen, et al.
Published: (2023)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

On the asymptotic behavior of a higher-order extrapolation primal-dual interior-point method for nonlinear programming
by: Heeman, Pim, et al.
Published: (2025)

Parallel block coordinate descent methods with identification strategies
by: Lopes, Ronaldo, et al.
Published: (2025)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2025)

Implicit augmented Lagrangian and generalized optimization
by: De Marchi, Alberto
Published: (2023)

Predictive Machine Learning to Increase the Throughput of Container Yards
by: Cooper, Austin Ford
Published: (2025)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
by: Deng, Kangkang, et al.
Published: (2025)

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
by: Marumo, Naoki
Published: (2025)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

Bregman proximal gradient method for linear optimization under entropic constraints
by: Briceño-Arias, Luis M., et al.
Published: (2025)

The Augmented Lagrangian Methods: Overview and Recent Advances
by: Deng, Kangkang, et al.
Published: (2025)

New gradient methods with 3 dimensional quadratic termination
by: Xie, Yixin, et al.
Published: (2026)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
by: Zhu, Kehan, et al.
Published: (2026)

Existence of augmented Lagrange multipliers: reduction to exact penalty functions and localization principle
by: Dolgopolik, M. V.
Published: (2018)

Local Convergence of Adaptively Regularized Tensor Methods
by: Welzel, Karl, et al.
Published: (2025)

Improved Penalty Function Approaches for Optimization Problems with General Orthogonality
by: Zhang, Yongshen, et al.
Published: (2026)

Augmented Lagrangian Functions for Cone Constrained Optimization: the Existence of Global Saddle Points and Exact Penalty Property
by: Dolgopolik, M. V.
Published: (2017)

A descent method for nonsmooth multiobjective optimization problems on Riemannian manifolds
by: Tang, Chunming, et al.
Published: (2023)