An efficient algorithm of dead-end controls for solving combinatorial optimization problems

DOI10.1134/S0005117921100076zbMath1483.90139OpenAlexW3215443135MaRDI QIDQ2069680

V. P. Korneenko

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117921100076

zbMATH Keywords

algorithmknapsack problemBellman functionpartition problemdead-end control

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new effective dynamic program for an investment optimization problem
• The nonlinear knapsack problem - algorithms and applications
• Graphical approach to combinatorial optimization
• A Minimal Algorithm for the 0-1 Knapsack Problem

This page was built for publication: An efficient algorithm of dead-end controls for solving combinatorial optimization problems