research10.1016/0898-1221(84)90055-5

A dynamic programming algorithm for multiple-choice constraints

Abstract

AbstractThis report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programming approach with fathoming by bounds and by infeasibility

Similar works

This paper was published in Elsevier - Publisher Connector .

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.