A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances
Year of publication: |
2015
|
---|---|
Authors: | Reilly, Charles H. ; Sapkota, Nabin |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 241.2015, 3 (16.3.), p. 642-652
|
Subject: | Entropy | Heuristics | Simulation | Correlation | Knapsack Problem | Theorie | Theory | Heuristik | Entropie | Ganzzahlige Optimierung | Integer programming | Korrelation |
-
Robust efficiency measures for linear knapsack problem variants
Wishon, Christopher, (2016)
-
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 ...
-
Simulating realistic set covering problems with known optimal solutions
Sapkota, Nabin, (2011)
-
Reilly, Charles H., (2015)
-
Synthetic optimization problem generation : show us the correlations!
Reilly, Charles H., (2009)
- More ...