Robust efficiency measures for linear knapsack problem variants
Year of publication: |
16 October 2016
|
---|---|
Authors: | Wishon, Christopher ; Villalobos, J. Rene |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 254.2016, 2 (16.10.), p. 398-409
|
Subject: | Combinatorial optimization | Heuristic | Genetic Algorithm | Knapsack problem | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics |
-
Heuristic concentration and tabu search : a nose to nose comparison
Rosing, K. E., (1997)
-
Heuristic and exact algorithms for the interval min-max regret knapsack problem
Furini, Fabio, (2015)
-
A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs
Cacchiani, Valentina, (2017)
- More ...
-
The strategic design of port services based on a total landed cost approach
González-Ramírez, Rosa G., (2020)
-
Corrective maintenance through dynamic work allocation and pre-emption : case study and application
Quintana, Rolando, (2009)
-
Using market intelligence for the opportunistic shipping of fresh produce
Flores, Hector, (2013)
- More ...