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

DOI10.1007/BF01609000MaRDI QIDQ4166537zbMATH OpenFDO

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

Publication date 1978

Published in Mathematical Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01609000

Mathematics Subject Classification ID

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

Cites work

• A Direct Descent Binary Knapsack Algorithm
• scientific article; zbMATH DE number 3681485 (Why is no real title available?)
• scientific article; zbMATH DE number 3524915 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3284927 (Why is no real title available?)
• The 0-1 knapsack problem with multiple choice constraints
• The cyclic separation scheduling problem
• The Multiple-Choice Knapsack Problem

Cited in

(6)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4166537)