We consider the 0/1 multi-dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR-Library multi-dimensional knapsack problem benchmarks instances.
Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
GROSSO, Andrea Cesare
2012-01-01
Abstract
We consider the 0/1 multi-dimensional knapsack problem and discuss the performances of a new heuristic procedure particularly suitable for a parallel computing environment embedding core problem approaches and a branching scheme based on reduced costs of the corresponding LP relaxation solution value. The proposed approach compared favorably to the recent state of the art procedures available in the literature on the well known OR-Library multi-dimensional knapsack problem benchmarks instances.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
deroga.pdf
Accesso riservato
Tipo di file:
DEROGA (OBBLIGATORIO ALLEGARE FILE CON MOTIVAZIONE)
Dimensione
22.91 kB
Formato
Adobe PDF
|
22.91 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
