Upper and lower bounding procedures for the multiple knapsack assignment problem
Seiji Kataoka; Takeo Yamada
| Year of publication: |
2014
|
|---|---|
| Authors: | Kataoka, Seiji ; Yamada, Takeo |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 237.2014, 2 (1.9.), p. 440-447
|
| Subject: | Combinatorial optimization | Heuristics | Multiple knapsack problem | Assignment problem | Lagrangian relaxation | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Heuristik | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound | Tourenplanung | Vehicle routing problem |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10010380013