| Nome |
# |
|
BPPLIB: a library for bin packing and cutting stock problems, file e1dcb335-5185-7715-e053-1705fe0a6cc9
|
349
|
|
Logic based Benders' decomposition for orthogonal stock cutting problems, file e1dcb335-3d75-7715-e053-1705fe0a6cc9
|
272
|
|
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem, file e1dcb335-7d25-7715-e053-1705fe0a6cc9
|
243
|
|
The traveling salesman problem with pickups, deliveries, and draft limits, file e1dcb335-3661-7715-e053-1705fe0a6cc9
|
212
|
|
Mathematical models and decomposition methods for the multiple knapsack problem, file e1dcb335-4d24-7715-e053-1705fe0a6cc9
|
198
|
|
Training software for orthogonal packing problems, file e1dcb335-693f-7715-e053-1705fe0a6cc9
|
151
|
|
Relaxations and heuristics for the multiple non-linear separable knapsack problem, file e1dcb335-726a-7715-e053-1705fe0a6cc9
|
134
|
|
Lower and upper bounds for the non-linear generalized assignment problem, file e1dcb337-1140-7715-e053-1705fe0a6cc9
|
15
|
|
Advances in Combinatorial Optimization, file e1dcb32d-6e14-7715-e053-1705fe0a6cc9
|
12
|
|
Ricerca Operativa per l’Economia e l’Impresa, file e1dcb32b-f858-7715-e053-1705fe0a6cc9
|
8
|
|
Ricerca Operativa per la Laurea Magistrale, file e1dcb32c-2423-7715-e053-1705fe0a6cc9
|
7
|
|
Exact and heuristic algorithms for the interval min-max regret generalized assignment problem, file e1dcb331-f822-7715-e053-1705fe0a6cc9
|
5
|
|
Logic based Benders' decomposition for orthogonal stock cutting problems, file e1dcb32f-6f1a-7715-e053-1705fe0a6cc9
|
4
|
|
Lower and upper bounds for the non-linear generalized assignment problem, file e1dcb335-edbf-7715-e053-1705fe0a6cc9
|
4
|
|
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems, file 28221972-0ee6-4ffe-bc65-8bdfc0ea476a
|
3
|
|
2DPackLib: a two-dimensional cutting and packing library, file 3457f429-9493-46de-a4ac-9aecab9e5806
|
3
|
|
Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems, file 8dbaf42d-a095-4aa9-a1a5-3350235592a7
|
3
|
|
BPPLIB: a library for bin packing and cutting stock problems, file e1dcb332-67bc-7715-e053-1705fe0a6cc9
|
3
|
|
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems, file 80a15457-4923-4d61-b768-ca2e01f9b44d
|
2
|
|
Surveys in Operations Research III, file e1dcb32c-1ccb-7715-e053-1705fe0a6cc9
|
2
|
|
Bin Packing Approximation Algorithms: Survey and Classification., file e1dcb32c-1d4d-7715-e053-1705fe0a6cc9
|
2
|
|
Training software for orthogonal packing problems, file e1dcb330-7e91-7715-e053-1705fe0a6cc9
|
2
|
|
The traveling salesman problem with pickups, deliveries, and draft limits, file e1dcb331-9316-7715-e053-1705fe0a6cc9
|
2
|
|
Mathematical models and decomposition methods for the multiple knapsack problem, file e1dcb331-f823-7715-e053-1705fe0a6cc9
|
2
|
|
Relaxations and heuristics for the multiple non-linear separable knapsack problem, file e1dcb332-1826-7715-e053-1705fe0a6cc9
|
2
|
|
Computational Advances in Combinatorial Optimization, file e1dcb332-1ca1-7715-e053-1705fe0a6cc9
|
2
|
|
Algorithmic approaches to the multiple knapsack assignment problem, file e1dcb333-8cca-7715-e053-1705fe0a6cc9
|
2
|
|
Combinatorial Optimization: Between Practice and Theory, file e1dcb333-b504-7715-e053-1705fe0a6cc9
|
2
|
|
Exact solution techniques for two-dimensional cutting and packing, file e1dcb338-e6d4-7715-e053-1705fe0a6cc9
|
2
|
|
Exact solution techniques for two-dimensional cutting and packing, file 3b6e27f0-0c69-45bd-ba4c-bcb7da43596e
|
1
|
|
Knapsack problems — An overview of recent advances. Part I: Single knapsack problems, file a091f4f5-abf9-4bfe-be0c-141cdf6d3276
|
1
|
|
Eleven surveys in operations research: III, file e1dcb32c-1ccd-7715-e053-1705fe0a6cc9
|
1
|
|
Computational Issues in Combinatorial Optimization, file e1dcb32c-4a06-7715-e053-1705fe0a6cc9
|
1
|
|
Models and algorithms for packing rectangles into the smallest square, file e1dcb32d-35f0-7715-e053-1705fe0a6cc9
|
1
|
|
Heuristic and exact algorithms for the interval min–max regret knapsack problem, file e1dcb32d-3de6-7715-e053-1705fe0a6cc9
|
1
|
|
Combinatorial optimization: theory, computation, and applications, file e1dcb32f-54bb-7715-e053-1705fe0a6cc9
|
1
|
|
An iterated dual substitution approach for the min-max regret multidimensional knapsack problem, file e1dcb32f-8343-7715-e053-1705fe0a6cc9
|
1
|
|
Combinatorial optimization: Theory, computation, and applications, file e1dcb32f-8aa2-7715-e053-1705fe0a6cc9
|
1
|
|
Heuristics for the General Multiple Non-linear Knapsack Problem, file e1dcb32f-b4e6-7715-e053-1705fe0a6cc9
|
1
|
|
Preface, file e1dcb332-67be-7715-e053-1705fe0a6cc9
|
1
|
|
Computational Advances in Combinatorial Optimization, file e1dcb332-cf2b-7715-e053-1705fe0a6cc9
|
1
|
|
The assignment and loading transportation problem, file e1dcb338-b10e-7715-e053-1705fe0a6cc9
|
1
|
| Totale |
1.661 |