scientific article

zbMath1274.90460MaRDI QIDQ2861508

Mathieu Lacroix, Ali Ridha Mahjoub, Hervé L. M. Kerivin

Publication date: 8 November 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001150

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Models for the single-vehicle preemptive pickup and delivery problem ⋮ On the complexity of the Eulerian closed walk with precedence path constraints problem

Cites Work

• Models for the single-vehicle preemptive pickup and delivery problem
• The NP-completeness of the Hamiltonian cycle problem in planar digraphs with degree bound two
• Combinatorial algorithms for DNA sequence assembly
• An Eulerian path approach to DNA fragment assembly

This page was built for publication: