Fractional packing in ideal clutters

DOI10.1007/s10107-010-0410-6zbMath1244.90198OpenAlexW3138290550MaRDI QIDQ431029

Yuji Matsuoka

Publication date: 26 June 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-010-0410-6

zbMATH Keywords

combinatorial optimizationpackingdijoinideal clutter

Mathematics Subject Classification ID

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

Related Items (2)

Stronger bounds and faster algorithms for packing in generalized kernel systems ⋮ Packing in generalized kernel systems: a framework that generalizes packing of branchings

Cites Work

• An algorithm for minimum cost arc-connectivity orientations
• A counterexample to a conjecture of Edmonds and Giles
• How to make a digraph strongly connected
• Geometric algorithms and combinatorial optimization
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial Optimization
• On the width—length inequality
• A Minimax Theorem for Directed Graphs
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• Fractional Packing ofT-Joins
• Centroids, Representations, and Submodular Flows
• Bottleneck extrema
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: Fractional packing in ideal clutters