scientific article; zbMATH DE number 5173819
From MaRDI portal
Publication:5294045
zbMath1118.90057MaRDI QIDQ5294045
Publication date: 23 July 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem ⋮ A relax-and-cut framework for large-scale maximum weight connected subgraph problems ⋮ A relax-and-cut algorithm for the set partitioning problem ⋮ A relax-and-cut framework for Gomory mixed-integer cuts ⋮ Lagrangian heuristics for the quadratic knapsack problem
This page was built for publication: