A mathematical programming system for preference and compatibility maximized menu planning and scheduling (Q4166537): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: The cyclic separation scheduling problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4102930 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3877400 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4178782 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The 0-1 knapsack problem with multiple choice constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Multiple-Choice Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5564917 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Direct Descent Binary Knapsack Algorithm / rank | |||
Normal rank | |||
Latest revision as of 23:08, 12 June 2024
scientific article; zbMATH DE number 3599802
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A mathematical programming system for preference and compatibility maximized menu planning and scheduling |
scientific article; zbMATH DE number 3599802 |
Statements
A mathematical programming system for preference and compatibility maximized menu planning and scheduling (English)
0 references
1978
0 references
