Copertina

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

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Donkiewicz, Tim, Gaul, Oliver
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Optimization and Control G.1.6; G.2.1; G.2.2; F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Unsplittable Multicommodity Flows in Outerplanar Graphs
di: Alemán-Espinosa, David, et al.
Pubblicazione: (2025)

Extended Dijkstra algorithm and Moore-Bellman-Ford algorithm
di: Cheng, Cong-Dian
Pubblicazione: (2017)

On the Min-Max Star Partitioning Number
di: Feldmann, Sarah, et al.
Pubblicazione: (2024)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
di: Wittwer, David, et al.
Pubblicazione: (2024)

Learning Latent Graph Geometry via Fixed-Point Schrödinger-Type Activation: A Theoretical Study
di: Pasechnyuk-Vilensky, Dmitry, et al.
Pubblicazione: (2025)

Block-weighted random graphs: planar and beyond
di: Kang, Mihyun, et al.
Pubblicazione: (2026)

Asymptotic Transfer in Critical Recursive Composition Schemes
di: Drmota, Michael, et al.
Pubblicazione: (2026)

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

New Results on Edge-coloring and Total-coloring of Split Graphs
di: Couto, Fernanda, et al.
Pubblicazione: (2023)

Joint Pricing and Matching for Resource Allocation Platforms via Min-cost Flow Problem
di: Hikima, Yuya, et al.
Pubblicazione: (2024)

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

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

Ethic Duality: A Homological Framework for Primal-Dual Problems
di: Pasechnyuk-Vilensky, Dmitry, et al.
Pubblicazione: (2025)

Graph Coloring for Multi-Task Learning
di: Patapati, Santosh
Pubblicazione: (2025)

Approximation Algorithms for Correlated Knapsack Orienteering
di: Espinosa, David Aleman, et al.
Pubblicazione: (2024)

Towards a better approach to the Vehicle Routing Problem
di: Abdoune, Souad, et al.
Pubblicazione: (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
di: Hochbaum, Dorit S.
Pubblicazione: (2016)

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

Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem
di: Bui, Quang Minh, et al.
Pubblicazione: (2022)

The Constrained Layer Tree Problem and Applications to Solar Farm Cabling
di: Bläsius, Thomas, et al.
Pubblicazione: (2024)

Counting $P_3$-convex sets in graphs
di: Dourado, Mitre C., et al.
Pubblicazione: (2026)

Criticality for Maker-Breaker domination games with predomination
di: Bujtás, Csilla, et al.
Pubblicazione: (2025)

Two-Sided Lossless Expanders in the Unbalanced Setting
di: Chattopadhyay, Eshan, et al.
Pubblicazione: (2024)

Slow Convergence of Ising and Spin Glass Models with Well-Separated Frustrated Vertices
di: Gillman, David, et al.
Pubblicazione: (2026)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
di: Gillman, David, et al.
Pubblicazione: (2025)

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

A reliability-aware randomized simheuristic for the stochastic team orienteering problem
di: Circelli, Michele
Pubblicazione: (2026)

A Riemannian Variational and Spectral Framework for High-Dimensional Sphere Packing: Barrier-Dynamics Reconciliation, Periodic Rigidity, and Discrete-Time Guarantees
di: Alpay, Faruk, et al.
Pubblicazione: (2025)

Convex Mixed-Integer Nonlinear Programs Derived from Generalized Disjunctive Programming using Cones
di: Neira, David E. Bernal, et al.
Pubblicazione: (2021)

Better Approximation for Weighted $k$-Matroid Intersection
di: Singer, Neta, et al.
Pubblicazione: (2024)

Graph-Based Specification and Automated Construction of ILP Problems
di: Ehmes, Sebastian, et al.
Pubblicazione: (2022)

Automatic Generation of Combinatorial Reoptimisation Problem Specifications: A Vision
di: Kratz, Maximilian, et al.
Pubblicazione: (2025)

Quantum walk informed variational algorithm design
di: Matwiejew, Edric, et al.
Pubblicazione: (2024)

The characteristic polynomials of $r$-uniform hypercycles with length $l$
di: Bo, Dong, et al.
Pubblicazione: (2025)

Decentralized Optimization with Topology-Independent Communication
di: Lin, Ying, et al.
Pubblicazione: (2025)

Approximation algorithms for the prize-collecting rural postman problem
di: Li, Hong, et al.
Pubblicazione: (2026)

On a Generalization of the Christoffel Tree: Epichristoffel Trees
di: Krishnamoorthy, Abhishek, et al.
Pubblicazione: (2025)

Explicit Solution Equation for Every Combinatorial Problem via Tensor Networks: MeLoCoToN
di: Ali, Alejandro Mata
Pubblicazione: (2025)

On the Complexity of Minimum Riesz s-Energy Subset Selection in Euclidean and Ultrametric Spaces
di: Emmerich, Michael T. M., et al.
Pubblicazione: (2026)

Model-Driven Rapid Prototyping for Control Algorithms with the GIPS Framework (System Description)
di: Kratz, Maximilian, et al.
Pubblicazione: (2025)