ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    A mathematical programming system for preference and compatibility maximized menu planning and scheduling (1978)
    Springer
    Mathematical programming 15 (1978), S. 63-76 
    Details
    ISSN: 1436-4646
    Keywords: Menu Planning ; Separation Scheduling ; Menu Scheduling ; Decomposition ; Non-linear Programming ; Binary Knapsack Problem ; Lagrangian Relaxation ; Transportation Problem ; Branch and Bound
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract In this paper, the analytical representation of food preference is used in a separable non-linear program to yield the serving frequencies of menu items for a finite time horizon. The frequencies obtained in this way insure cost and nutritional control. Subsequently, the scheduling problem dealing with item assignments to meals and days is formulated as an integer program consisting of several transportation problems linked by weekly nutritional constraints. This problem is solved using a branch and bound algorithm which employs Lagrangian relaxation to obtain bounds and to decide on branching strategy.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01609000
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    A branch and bound algorithm for the generalized assignment problem (1975)
    Springer
    Mathematical programming 8 (1975), S. 91-103 
    Details
    ISSN: 1436-4646
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract This paper describes what is termed the “generalized assignment problem”. It is a generalization of the ordinary assignment problem of linear programming in which multiple assignments of tasks to agents are limited by some resource available to the agents. A branch and bound algorithm is developed that solves the generalized assignment problem by solving a series of binary knapsack problems to determine the bounds. Computational results are cited for problems with up to 4 000 0–1 variables, and comparisons are made with other algorithms.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01580430
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...