Pages that link to "Item:Q2892141"
From MaRDI portal
The following pages link to The complexity of the node capacitated in-tree packing problem (Q2892141):
Displaying 3 items.
- An LP-based heuristic algorithm for the node capacitated in-tree packing problem (Q1762017) (← 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)
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing (Q4018533) (← links)