Path packing and a related optimization problem

DOI10.1007/S10878-007-9107-ZMaRDI QIDQ841602zbMATH OpenOpenAlexFDO

Authors Natalia Vanetik

Publication date 18 September 2009

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-007-9107-z

zbMATH Keywords

K-cluttermultiflow

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• On return path packing.
• On the fractionality of the path packing problem
• Odd path packings
• On extremal multiflows
• A note on packing paths in planar graphs

Cites work

• scientific article; zbMATH DE number 16298 (Why is no real title available?)
• On extremal multiflows
• On return path packing.
• On some connectivity properties of Eulerian graphs
• Polyhedra related to undirected multicommodity flows

Cited in

(10)

• On return path packing.
• Approximating disjoint-path problems using packing integer programs
• The path set packing problem
• Optimum path packing on wheels: The consecutive case
• On the fractionality of the path packing problem
• scientific article; zbMATH DE number 4089565 (Why is no real title available?)
• Flows with Unit Path Capacities and Related Packing and Covering Problems
• Online simple knapsack with reservation costs
• Shortest \((A+B)\)-path packing via hafnian
• Odd path packings

This page was built for publication: Path packing and a related optimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841602)