Image de couverture de livre

Benders Cut Filtering for Affine Potential-Based Flow Problems with Robustness Scenarios and Topology Switching

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Donkiewicz, Tim, Gaul, Oliver
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control G.1.6; G.2.1; G.2.2; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Unsplittable Multicommodity Flows in Outerplanar Graphs
par: Alemán-Espinosa, David, et autres
Publié: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
par: Cheng, Cong-Dian
Publié: (2017)

On the Min-Max Star Partitioning Number
par: Feldmann, Sarah, et autres
Publié: (2024)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
par: Wittwer, David, et autres
Publié: (2024)

Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study
par: Pasechnyuk-Vilensky, Dmitry, et autres
Publié: (2025)

Block-weighted random graphs: planar and beyond
par: Kang, Mihyun, et autres
Publié: (2026)

Asymptotic Transfer in Critical Recursive Composition Schemes
par: Drmota, Michael, et autres
Publié: (2026)

Beyond Worst-Case Subset Sum: An Adaptive, Structure-Aware Solver with Sub-$2^{n/2}$ Enumeration
par: Salas, Jesus
Publié: (2025)

New Results on Edge-coloring and Total-coloring of Split Graphs
par: Couto, Fernanda, et autres
Publié: (2023)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
par: Hikima, Yuya, et autres
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part I: Theory
par: Warme, David M.
Publié: (2024)

Quantitative Indicators for Strength of Inequalities with Respect to a Polyhedron, Part II: Applications and Computational Evidence
par: Warme, David M.
Publié: (2024)

Ethic Duality: A Homological Framework for Primal-Dual Problems
par: Pasechnyuk-Vilensky, Dmitry, et autres
Publié: (2025)

Graph Coloring for Multi-Task Learning
par: Patapati, Santosh
Publié: (2025)

Approximation Algorithms for Correlated Knapsack Orienteering
par: Espinosa, David Aleman, et autres
Publié: (2024)

Towards a better approach to the Vehicle Routing Problem
par: Abdoune, Souad, et autres
Publié: (2025)

Min cost flow on unit capacity networks and convex cost K-flow are as easy as the assignment problem with All-Min-Cuts algorithm
par: Hochbaum, Dorit S.
Publié: (2016)

Unbelievable $O(L^{1.5})$ worst case computational complexity achieved by $spdspds$ algorithm for linear programming problem
par: Halemane, Keshava Prasad
Publié: (2014)

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
par: Bui, Quang Minh, et autres
Publié: (2022)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
par: Bläsius, Thomas, et autres
Publié: (2024)

Counting $P_3$-convex sets in graphs
par: Dourado, Mitre C., et autres
Publié: (2026)

Criticality for Maker-Breaker domination games with predomination
par: Bujtás, Csilla, et autres
Publié: (2025)

Two-Sided Lossless Expanders in the Unbalanced Setting
par: Chattopadhyay, Eshan, et autres
Publié: (2024)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
par: Gillman, David, et autres
Publié: (2026)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
par: Gillman, David, et autres
Publié: (2025)

Comparative Evaluation of SDP, SOCP, and QC Convex Relaxations for Large-Scale Market-Based AC Optimal Power Flow
par: Keskin, Ata
Publié: (2026)

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
par: Circelli, Michele
Publié: (2026)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
par: Alpay, Faruk, et autres
Publié: (2025)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
par: Neira, David E. Bernal, et autres
Publié: (2021)

Better Approximation for Weighted $k$-Matroid Intersection
par: Singer, Neta, et autres
Publié: (2024)

Graph-Based Specification and Automated Construction of ILP Problems
par: Ehmes, Sebastian, et autres
Publié: (2022)

Automatic Generation of Combinatorial Reoptimisation Problem Specifications: A Vision
par: Kratz, Maximilian, et autres
Publié: (2025)

Quantum walk informed variational algorithm design
par: Matwiejew, Edric, et autres
Publié: (2024)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
par: Bo, Dong, et autres
Publié: (2025)

Decentralized Optimization with Topology-Independent Communication
par: Lin, Ying, et autres
Publié: (2025)

Approximation algorithms for the prize-collecting rural postman problem
par: Li, Hong, et autres
Publié: (2026)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
par: Krishnamoorthy, Abhishek, et autres
Publié: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
par: Ali, Alejandro Mata
Publié: (2025)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
par: Emmerich, Michael T. M., et autres
Publié: (2026)

Model-Driven Rapid Prototyping for Control Algorithms with the GIPS Framework (System Description)
par: Kratz, Maximilian, et autres
Publié: (2025)