Pages that link to "Item:Q1042147"
From MaRDI portal
The following pages link to An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem (Q1042147):
Displaying 11 items.
- Capacity allocation problem with random demands for the rail container carrier (Q439359) (← links)
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem (Q439503) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- Complexity indices for the multidimensional knapsack problem (Q2045626) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
- Iterative approaches for a dynamic memory allocation problem in embedded systems (Q2356204) (← links)
- Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
- Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints (Q5175471) (← links)
- A three-phase matheuristic algorithm for the multi-day task assignment problem (Q6047850) (← links)
- Variable neighborhood search: the power of change and simplicity (Q6164603) (← links)
