A mathematical programming system for preference and compatibility maximized menu planning and scheduling
From MaRDI portal
Publication:4166537
DOI10.1007/BF01609000zbMath0385.90058MaRDI QIDQ4166537
G. Terry Ross, Joseph L. Balintfy, Andris A. Zoltners, Prabhakant Sinha
Publication date: 1978
Published in: Mathematical Programming (Search for Journal in Brave)
90C90: Applications of mathematical programming
90B35: Deterministic scheduling theory in operations research
90B99: Operations research and management science
Related Items
A branch and bound algorithm for solving the multiple-choice knapsack problem, A heuristic for multiple choice programming, The history of the application of mathematical programming to menu planning, Multi-constrained matroidal knapsack problems, A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
Cites Work