Cover Image

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Besançon, Mathieu
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Convex mixed-integer optimization with Frank-Wolfe methods
by: Hendrych, Deborah, et al.
Published: (2022)

A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem
by: Li, Zongji, et al.
Published: (2023)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Sparse Approximation in Lattices and Semigroups
by: Kuhlmann, Stefan, et al.
Published: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

On Supportedness in Multi-Objective Combinatorial Optimization
by: Könen, David, et al.
Published: (2025)

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)

Valid Cuts for the Design of Potential-based Flow Networks
by: Börner, Pascal, et al.
Published: (2025)

Minimum Cut Representability of Stable Matching Problems
by: Faenza, Yuri, et al.
Published: (2025)

Real-time Optimization of Transport Chains for Single Wagon Load Railway Transport
by: Moldenhauer, Carsten, et al.
Published: (2025)

Geoffrion's theorem beyond finiteness and rationality
by: Dey, Santanu S., et al.
Published: (2025)

A review of minimum cost box searching games
by: Lidbetter, Thomas
Published: (2025)

Towards a geometric characterization of unbounded integer cubic optimization problems via thin rays
by: Del Pia, Alberto
Published: (2025)

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
Published: (2025)

Projection-width as a structural parameter for discrete separable optimization
by: Del Pia, Alberto
Published: (2025)

Normalizations of factorizations over convex cones and their effects on extension complexity
by: Brown, Adam, et al.
Published: (2025)

Extended formulations for the multilinear polytope of acyclic hypergraphs
by: Del Pia, Alberto, et al.
Published: (2025)

The complete edge relaxation for binary polynomial optimization
by: Del Pia, Alberto, et al.
Published: (2025)

Aircraft routing: periodicity and complexity
by: Meunier, Frédéric, et al.
Published: (2025)

On the integrality Gap of Small Asymmetric Traveling Salesman Problems: A Polyhedral and Computational Approach
by: Vercesi, Eleonora, et al.
Published: (2025)

Geometry of the Reformulation-Linearization-Technique: Domination of Disjunctions
by: Hof, Hugo A., et al.
Published: (2025)

Combinatorial Algorithm for Tropical Linearly Factorized Programming
by: Nishida, Yuki
Published: (2025)

Linear Programming Hierarchies Collapse under Symmetry
by: Faenza, Yuri, et al.
Published: (2025)

A parallel pull labelling algorithm for the resource constrained shortest path problem
by: Petersen, Bjørn, et al.
Published: (2025)

A Branch-and-Cut Algorithm for the Optimal Design of Parking Lots with One-way and Two-way Lanes
by: Thomas, Helen, et al.
Published: (2025)

Scheduling on identical machines with conflicts to minimize the mean flow time
by: Tellache, Nour ElHouda, et al.
Published: (2025)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
by: Liu, Haoyue, et al.
Published: (2025)

The Integrality Gap of the Traveling Salesman Problem is $4/3$ if the LP Solution Has at Most $n+6$ Non-zero Components
by: Villa, Tullio, et al.
Published: (2025)

Tree-based formulation for the multi-commodity flow problem
by: Spoorendonk, Simon, et al.
Published: (2025)

Vehicle Routing Problems in the Age of Semi-Autonomous Driving
by: Hu, Hins, et al.
Published: (2025)

Multilevel Facility Location Optimization: A Novel Integer Programming Formulation and Approaches to Heuristic Solutions
by: Alidaee, Bahram, et al.
Published: (2024)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
by: Proença, Nathan Benedetto, et al.
Published: (2026)

Randomized Max-Vertex-Cover Interdiction with Matroid Constraints
by: Wang, Changjun, et al.
Published: (2026)

On the Virtual Network Embedding polytope
by: Benhamiche, Amal, et al.
Published: (2026)

Facet-Defining Inequalities for the Angle-Based DC Optimal Transmission Switching Formulation
by: Jabbari-Marand, Behnam, et al.
Published: (2026)

Shortest Paths in Graphs of Convex Sets
by: Marcucci, Tobia, et al.
Published: (2021)

Lower bounds for the integrality gap of the bi-directed cut formulation of the Steiner Tree Problem
by: Bernardelli, Ambrogio Maria, et al.
Published: (2024)

Order acceptance and scheduling in capacitated job shops
by: Linß, Florian, et al.
Published: (2024)

Market proliferation and the impact of locational complexity on network restructuring
by: Pinar-Pérez, J. M., et al.
Published: (2024)

Factorized binary polynomial optimization
by: Del Pia, Alberto
Published: (2024)