scientific article

From MaRDI portal

Publication:2735077

Jump to:navigation, search

zbMath0990.90101MaRDI QIDQ2735077

A. Kulanoot, Louis Caccetta

Publication date: 20 August 2002

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic programming combinatorial optimization branch and bound knapsack problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Dynamic programming (90C39)

Related Items (2)

A heuristic for the problem of one-dimensional steel coil cutting ⋮ Measuring instance difficulty for combinatorial optimization problems

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2735077&oldid=15596739"