The 0-1 knapsack problem with a single continuous variable (KPC) is a natural extension of the binary knapsack problem (KP), where the capacity is not any longer fixed but can be extended which is expressed by a continuous variable. This variable might be unbounded or restricted by a lower or...

The "Capacitated lot sizing problem with setup carry-over" is based ort the well known "Capacitated lot sizing problem" and incorporates the possibility of preserving a setup-state from a period to the following. Sox and Gao [2] decompose their formulation of the first one (GCLP1) by Lagrangian...

Operations Research ist bei der immer noch zunehmenden Durchdringung betrieblicher und anderer Prozesse durch IT omnipräsent. Dieses Buch richtet sich an Studierende und Praktiker, die keine tiefe mathematische Ausbildung genossen haben, und dennoch die Konzepte und Funktionsweisen der...