Imagen de Portada

A Framework for Handling and Exploiting Symmetry in Benders' Decomposition

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hojny, Christopher, Roy, Cédric
Formato:	Preprint
Publicado:	2025
Materias:	Optimization and Control 90C10
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
por: Guo, Feng, et al.
Publicado: (2024)

Bus Fleet Electrification Planning Through Logic-Based Benders Decomposition and Restriction Heuristics
por: Legault, Robin, et al.
Publicado: (2025)

A Boosted-DCA with Power-Sum-DC Decomposition for Linearly Constrained Polynomial Programs
por: Zhang, Hu, et al.
Publicado: (2022)

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

The Quadratic Bin Packing Problem: Exact Formulations and Algorithm
por: Chagas, Vítor Gomes, et al.
Publicado: (2026)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
por: Tanınmış, Kübra, et al.
Publicado: (2023)

Extended formulations for the integer hull of strictly $Δ$-modular cographic polyhedral cones
por: Paat, Joseph, et al.
Publicado: (2023)

Multi-layer continuous carbon fiber pattern optimization and a spline based path planning interpretation
por: Wein, Fabian, et al.
Publicado: (2024)

Parallelized Conflict Graph Cut Generation
por: Dai, Yongzheng, et al.
Publicado: (2023)

Serial and Parallel Two-Column Probing for Mixed-Integer Programming
por: Dai, Yongzheng, et al.
Publicado: (2024)

Exploiting Sparsity in Complex Polynomial Optimization
por: Wang, Jie, et al.
Publicado: (2021)

A polynomially solvable case of unconstrained (-1,1)-quadratic fractional optimization
por: Yang, Meijia, et al.
Publicado: (2024)

A Successive Refinement for Solving Stochastic Programs with Decision-Dependent Random Capacities
por: Medal, Hugh, et al.
Publicado: (2024)

Cutting planes for signomial programming
por: Xu, Liding, et al.
Publicado: (2022)

Linear Decision Tree Policies for Integer Linear Programs
por: Guyard, Théo, et al.
Publicado: (2026)

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

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
por: Liu, Zekun, et al.
Publicado: (2026)

Robust Capacity Expansion Modelling for Renewable Energy Systems
por: Kebrich, Sebastian, et al.
Publicado: (2025)

Topology optimization and boundary observation for clamped plates
por: Murea, Cornel Marius, et al.
Publicado: (2023)

The SCIP Optimization Suite 9.0
por: Bolusani, Suresh, et al.
Publicado: (2024)

A Successive Refinement Algorithm for Tri-Level Stochastic Defender-Attacker Problems with Decision-Dependent Probability Distributions
por: Affar, Samuel, et al.
Publicado: (2024)

Stable formulations for the Capacitated Facility Location Problem with Customer Preferences
por: Domínguez, Concepción, et al.
Publicado: (2025)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
por: Luo, Fengqiao, et al.
Publicado: (2021)

Generalizations of Total Dual Integrality
por: Guenin, Bertrand, et al.
Publicado: (2025)

Structural Insights and an IP-based Solution Method for Patient-to-room Assignment under Consideration of Single Room Entitlements
por: Brandt, Tabea, et al.
Publicado: (2023)

The SCIP Optimization Suite 10.0
por: Hojny, Christopher, et al.
Publicado: (2025)

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization
por: Carciaghi, Francesco, et al.
Publicado: (2024)

Solving Cutting Stock Problems via an Extended Ryan-Foster Branching Scheme and Fast Column Generation
por: da Silva, Renan F. F., et al.
Publicado: (2023)

Beyond binarity: Semidefinite programming for ternary quadratic problems
por: de Meijer, Frank, et al.
Publicado: (2026)

A Matrix Optimization Method for Blind Extraction of External Equitable Partitions from Low Pass Graph Signals
por: Teng, Wenshun, et al.
Publicado: (2025)

Introducing Clause Cuts: Strong No-Good Cuts for MaxSAT Problems in Mixed Integer Linear Programming
por: Engelhardt, Max, et al.
Publicado: (2025)

Box Allocation Optimization in Meal Kit Delivery
por: Nguyen, Thi Minh Thu, et al.
Publicado: (2025)

Exploiting Term Sparsity in Symmetry-Adapted Basis for Polynomial Optimization
por: Klep, Igor, et al.
Publicado: (2025)

Exploiting Overlap Information in Chance-constrained Program with Random Right-hand Side
por: Lv, Wei, et al.
Publicado: (2024)

Progressively Strengthening and Tuning MIP Solvers for Reoptimization
por: Patel, Krunal Kishor
Publicado: (2023)

A Bregman ADMM for Bethe variational problem
por: Khoo, Yuehaw, et al.
Publicado: (2025)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
por: Yang, Dominic, et al.
Publicado: (2025)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
por: Selicato, Laura, et al.
Publicado: (2025)