Pages that link to "Item:Q1907770"
From MaRDI portal
The following pages link to Integral packing of trees and branchings (Q1907770):
Displaying 14 items.
- A faster algorithm for packing branchings in digraphs (Q494431) (← links)
- On cyclic packing of a tree (Q704857) (← links)
- On self-complementary cyclic packing of forests (Q1010622) (← links)
- Main directions in the development of informatics (Q1280975) (← links)
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs (Q1290635) (← links)
- An algorithm for packing connectors (Q1569028) (← links)
- Academician V. S. Mikhalevich as a scientist and science organizer (on the occasion of his 70th birthday) (Q1592008) (← links)
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← links)
- Some directions and results of research in mathematical programming and system analysis (Q1918737) (← links)
- Packing branchings under cardinality constraints on their root sets (Q2225417) (← links)
- (Q3033795) (← links)
- LAGRANGIAN-BASED COLUMN GENERATION FOR THE NODE CAPACITATED IN-TREE PACKING PROBLEM(<Special Issue>SCOPE (Seminar on Computation and OPtimization for new Extensions)) (Q3144760) (← links)
- Packing the divergence functions (Q3979312) (← links)
- Integral packing of branchings in capacitaded digraphs (Q5963635) (← links)