A Depot Location-Allocation Problem of a Food Producer with an Outsourcing Option

Engeler, Katja; Klose, Andreas; Stähly, Paul

doi:10.1007/978-3-642-58568-5_5

Cited by 2 publications

(1 citation statement)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Applications of discrete location problems include location and distribution planning (see e. g. Geoflrion and Graves (1974), Gelders et al (1987), Tüshaus and Wittmann (1998), Engeler et al (1999), Bruns et al (2000)), lotsizing in production planning (Pochet and Wolsey (1988)), telecommunication and Computer network design (Mirzaian (1985), Boffey (1989), Chardaire (1999)), vendor selection (Current and Weber (1994)), and physical database design (Caprara and Salazar (1999)). For comprehensive surveys of discrete location problems, we refer the reader to Aikens (1985), Mirchandani and Francis (1990), Daskin (1995), Revelle and Laporte (1996), Domschke and Krispin (1997) and Owen and Daskin (1998).…”

Section: Discrete Location Problemsmentioning

confidence: 99%

Combinatorial Optimisation Problems of the Assignment Type and a Partitioning Approach

Klose

Drexl

2002

Lecture Notes in Economics and Mathematical Systems

Self Cite

View full text Add to dashboard Cite

Standard-Nutzungsbedingungen:Die Dokumente auf EconStor dürfen zu eigenen wissenschaftlichen Zwecken und zum Privatgebrauch gespeichert und kopiert werden.Sie dürfen die Dokumente nicht für öffentliche oder kommerzielle Zwecke vervielfältigen, öffentlich ausstellen, öffentlich zugänglich machen, vertreiben oder anderweitig nutzen.Sofern die Verfasser die Dokumente unter Open-Content-Lizenzen (insbesondere CC-Lizenzen) zur Verfügung gestellt haben sollten, gelten abweichend von diesen Nutzungsbedingungen die in der dort genannten Lizenz gewährten Nutzungsrechte. Abstract Assignment type problems consist in optimally assigning or allocating a given set of "activities" to a given set of "resources". Optimisation problems of the assignment type have numerous applications in production planning and logistics. A populär approach to solve such problems or to compute lower b ounds on the optimal Solution value (in case of a minimisation problem) is to employ column generation. By means of co nsidering subsets of "activities" which can feasibly be assigned to a Single resource, the problem is reformulated as some kind of set-partitioning problem. Column generation is then used in order to solve the linear relaxation of the reformulation. The lower bound obtainable from this approach may, however, be improved by partitioning the set of resources into subsets and by considering subsets of activities which can feasibly be assigned to subsets of resources. This paper outlines the application of this partitioning method to a number of important combinatorial optimisation problems of the assignment type. Terms of use: Documents in EconStor may

show abstract