Cover Image

On a Variant of the Minimum Path Cover Problem in Acyclic Digraphs: Computational Complexity Results and Exact Method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tellache, Nour ElHouda, Baldacci, Roberto
Format:	Preprint
Published:	2025
Subjects:	Discrete Mathematics Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

A column-generation approach for an electricity technician routing and scheduling problem with a lexicographic objective
by: Bangerter, Elise, et al.
Published: (2026)

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

Minimum 0-Extension Problems on Directed Metrics
by: Hirai, Hiroshi, et al.
Published: (2020)

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

Constrained Shortest-Path Reformulations via Decision Diagrams for Structured Two-stage Optimization Problems
by: Lozano, Leonardo, et al.
Published: (2022)

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

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

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

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

A Tight Formulation for the Dial-a-Ride Problem
by: Gaul, Daniela, et al.
Published: (2023)

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

The Mixed Integer Trust Region Problem
by: Del Pia, Alberto
Published: (2024)

Asymptotic Bounds for the Traveling Salesman Problem with Drone
by: Lee, Jae Hyeok, et al.
Published: (2026)

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

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

Branch and Price for the Length-Constrained Cycle Partition Problem
by: Ghannam, Mohammed, et al.
Published: (2024)

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)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
by: Besançon, Mathieu
Published: (2025)

Computing Lower Bounds on the Nonnegative Rank via Non-Convex Optimization Solvers
by: Baeckelant, Timothy, et al.
Published: (2026)

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)

On the Computational Complexity of Multi-Objective Ordinal Unconstrained Combinatorial Optimization
by: Figueira, José Rui, et al.
Published: (2024)

System Architecture Optimization Strategies: Dealing with Expensive Hierarchical Problems
by: Bussemaker, Jasper H., et al.
Published: (2025)

Tight Bounds for the Maximum Distance Over a Polytope to a Given Point
by: Costandin, Marius, et al.
Published: (2023)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
by: Proença, Nathan Benedetto, et al.
Published: (2023)

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

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

Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
by: Lucci, Mauro, et al.
Published: (2026)

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)

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

An exact approach for the multi-depot electric vehicle scheduling problem
by: Haslinger, Xenia, et al.
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)

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)