A mathematical programming system for preference and compatibility maximized menu planning and scheduling (Q4166537): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:08, 13 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
    0 references
    0 references
    0 references
    0 references
    0 references
    1978
    0 references
    0 references
    0 references
    0 references
    0 references