scientific article; zbMATH DE number 3637598

zbMath0409.90063MaRDI QIDQ4197626

Silvano Martello, Paolo Toth

Publication date: 1979

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

zbMATH Keywords

Dynamic ProgrammingInteger ProgrammingKnapsack ProblemBranch-And-Bound AlgorithmImplicit EnumerationComputational ExperienceLarge-Scale ProblemsAlgorithmic PerformanceSpecial Models

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

A hard knapsack problem, A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances, Dynamic programming algorithms for the zero-one knapsack problem, Multivariate composite distributions for coefficients in synthetic optimization problems, Scheduling to minimize weighted earliness and tardiness about a common due-date, Rational solutions of the graphsack problem, Controlling the losing probability in a monotone game, Playing monotone games to understand learning behaviors, The multi-Handler knapsack problem under uncertainty