A dynamic programming algorithm for multiple-choice constraints
From MaRDI portal
Publication:798257
DOI10.1016/0898-1221(84)90055-5zbMath0545.90077MaRDI 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
linear constraintsfactorable objective functionfathoming by bounds and by infeasibilitymultiple-choice constraintsseparable objective function
65K05: Numerical mathematical programming methods
90C10: Integer programming
90C39: Dynamic programming
90C09: Boolean programming
Related Items
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