A dynamic programming algorithm for multiple-choice constraints

DOI10.1016/0898-1221(84)90055-5zbMath0545.90077OpenAlexW2060712332MaRDI QIDQ798257

Keyvan Farhangian, Mary W. Cooper

Publication date: 1984

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(84)90055-5

zbMATH Keywords

linear constraintsfactorable objective functionfathoming by bounds and by infeasibilitymultiple-choice constraintsseparable objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Dynamic programming (90C39) Boolean programming (90C09)

Related Items

Computational comparison on the partitioning strategies in multiple choice integer programming

Cites Work

• Unnamed Item
• Non-linear integer programming
• Nonlinear integer programming for various forms of constraints
• An integer programming algorithm for portfolio selection with fixed charges
• Quadratic knapsack problems
• Branch and Bound Methods for Multi-Item Scheduling
• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
• The Multiple-Choice Knapsack Problem
• An integer programming approach to a class of combinatorial problems

This page was built for publication: A dynamic programming algorithm for multiple-choice constraints