scientific article; zbMATH DE number 1769298
From MaRDI portal
Publication:4540048
DOI<205::AID-NET1>3.0.CO;2-H 10.1002/(SICI)1097-0037(199807)31:4<205::AID-NET1>3.0.CO;2-HzbMath1002.90043MaRDI QIDQ4540048
Publication date: 21 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Queues and service in operations research (90B22) Combinatorial optimization (90C27)
Related Items (7)
A pegging approach to the precedence-constrained knapsack problem ⋮ An overview of graph covering and partitioning ⋮ Vertex covering with capacitated trees ⋮ Exact approaches for solving a covering problem with capacitated subtrees ⋮ Tree knapsack approaches for local access network design ⋮ Heuristic and exact algorithms for the precedence-constrained knapsack problem ⋮ Exact and heuristic algorithms for dynamic tree simplification
This page was built for publication:
