Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
Audrey Cerqueus; Anthony Przybylski; Xavier Gandibleux
| Year of publication: |
2015
|
|---|---|
| Authors: | Cerqueus, Audrey ; Przybylski, Anthony ; Gandibleux, Xavier |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 2 (16.7.), p. 417-433
|
| Subject: | Combinatorial optimization | Multiple objective programming | Bi-dimensional binary knapsack problem | Surrogate relaxation | Bound sets | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Multikriterielle Entscheidungsanalyse | Multi-criteria analysis | Scheduling-Verfahren | Scheduling problem |
| Extent: | graph. Darst. |
|---|---|
| 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://ebvufind01.dmz1.zbw.eu/10010531907