A mathematical programming system for preference and compatibility maximized menu planning and scheduling

DOI10.1007/BF01609000zbMath0385.90058MaRDI QIDQ4166537

Joseph L. Balintfy, Andris A. Zoltners, G. Terry Ross, Prabhakant Sinha

Publication date: 1978

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Operations research and management science (90B99)

Related Items (6)

A heuristic for multiple choice programming ⋮ A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem ⋮ Shrimp feed formulation via evolutionary algorithm with power heuristics for handling constraints ⋮ The history of the application of mathematical programming to menu planning ⋮ A branch and bound algorithm for solving the multiple-choice knapsack problem ⋮ Multi-constrained matroidal knapsack problems

Cites Work

• The 0-1 knapsack problem with multiple choice constraints
• A Direct Descent Binary Knapsack Algorithm
• The cyclic separation scheduling problem
• The Multiple-Choice Knapsack Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A mathematical programming system for preference and compatibility maximized menu planning and scheduling