Cover Image

Atomic Column Generation For Consensus Between Algorithms: Application to Path Computation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Martin, Sébastien, Bauguion, Pierre, Magnouche, Youcef, Leguay, Jérémie
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Atomic Column Generation for Consensus Between Algorithms: Application to Path Computation
by: Sebastien Martin, et al.
Published: (2025)

Alternative paths computation for congestion mitigation in segment-routing networks
by: Martin, Sébastien, et al.
Published: (2024)

On the Multi-Commodity Flow with convex objective function: Column-Generation approaches
by: Beraud-Sudreau, Guillaume, et al.
Published: (2026)

Contribution to Blocker and Interdiction optimization problems in networks
by: Martin, Sébastien
Published: (2024)

Flip Paths Between Lattice Triangulations
by: Sims, William, et al.
Published: (2020)

Boundary rigidity of finite CAT(0) cube complexes
by: Chalopin, Jérémie, et al.
Published: (2023)

Sample compression schemes for balls in graphs
by: Chalopin, Jérémie, et al.
Published: (2022)

Pricing Filtering in Dantzig-Wolfe Decomposition
by: Mehamdi, Abdellah Bulaich, et al.
Published: (2024)

A Three-Dimensional SFT with Sparse Columns
by: Salo, Ville, et al.
Published: (2025)

Enumeration of Row-Column Designs
by: Jäger, Gerold, et al.
Published: (2024)

Upper bounds on the average number of colors in the non-equivalent colorings of a graph
by: Hertz, Alain, et al.
Published: (2021)

Excluding a Line Minor via Design Matrices and Column Number Bounds for the Circuit Imbalance Measure
by: Dadush, Daniel, et al.
Published: (2025)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
by: Bénéteau, Laurine, et al.
Published: (2022)

Twin-width of sparse random graphs
by: Hendrey, Kevin, et al.
Published: (2023)

Polynomial-Size Enumeration Kernelizations for Long Path Enumeration
by: Komusiewicz, Christian, et al.
Published: (2025)

An Identity for Catalan Numbers via Restricted Dyck Paths
by: Bernini, Antonio, et al.
Published: (2026)

Optimizing Tensor Contraction Paths: A Greedy Algorithm Approach With Improved Cost Functions
by: Orgler, Sheela, et al.
Published: (2024)

Algorithmic Aspects of Temporal Betweenness
by: Buß, Sebastian, et al.
Published: (2020)

The Storage Location Assignment and Picker Routing Problem: A Generic Branch-Cut-and-Price Algorithm
by: Prunet, Thibault, et al.
Published: (2024)

Computation of Graph Polynomials via Tree Decomposition: Theory, Algorithms, and Python Implementation
by: Bafna, Mehul, et al.
Published: (2025)

A Dense Neighborhood Lemma: Applications of Partial Concept Classes to Domination and Chromatic Number
by: Bourneuf, Romain, et al.
Published: (2025)

Path degeneracy and applications
by: Lin, Y., et al.
Published: (2025)

Algorithms for the Global Domination Problem
by: Inza, Ernesto Parra, et al.
Published: (2023)

Progressive and Rushed Dyck Paths
by: Bacher, Axel
Published: (2024)

Bounds on Path Energy of Graphs
by: Narke, Amol P., et al.
Published: (2022)

Sublinear Longest Path Transversals
by: Long Jr., James A., et al.
Published: (2020)

Regular packing of rooted hyperforests with root constraints in hypergraphs
by: Hoppenot, Pierre, et al.
Published: (2023)

Symbolic Listings as Computation
by: Sawczuk, Hamilton, et al.
Published: (2024)

Coloring Grids Avoiding Bicolored Paths
by: Keskinkilic, Derman, et al.
Published: (2023)

On Separating Path and Tree Systems in Graphs
by: Biniaz, Ahmad, et al.
Published: (2023)

Menger's Theorem for Temporal Paths (Not Walks)
by: Ibiapina, Allen, et al.
Published: (2022)

Effective approach of the tridendriform Schroeder tree algebra
by: Catoire, Pierre, et al.
Published: (2026)

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

Computing Height-Optimal Tangles Faster
by: Firman, Oksana, et al.
Published: (2019)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
by: Zhou, Xiaotian, et al.
Published: (2025)

The Complexity of Color-constrained Paths in Semicomplete Multipartite Digraphs
by: Brinkmann, Julian
Published: (2025)

Application of the Quantum Approximate Optimization Algorithm in Solving the Total Domination Problem
by: Pan, Haoqian, et al.
Published: (2024)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)

Generating minimal redundant and maximal irredundant sets in incidence graphs
by: Castelo, Emanuel, et al.
Published: (2026)