Pages that link to "Item:Q3885516"
From MaRDI portal
The following pages link to New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem (Q3885516):
Displayed 30 items.
- Optimal selection of energy efficiency measures for energy sustainability of existing buildings (Q342204) (← links)
- Capacity allocation problem with random demands for the rail container carrier (Q439359) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
- Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem (Q960412) (← links)
- Algorithmic aspects for power-efficient hardware/software partitioning (Q1010046) (← links)
- Zero-one integer programs with few contraints - lower bounding theory (Q1060954) (← links)
- Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997) (← links)
- Zero-one integer programs with few constraints - Efficient branch and bound algorithms (Q1073718) (← links)
- A class of practical interactive branch and bound algorithms for multicriteria integer programming (Q1075953) (← links)
- A simulated annealing approach to the multiconstraint zero-one knapsack problem (Q1099588) (← links)
- Surrogate duality in a branch-and-bound procedure for integer programming (Q1099783) (← links)
- A computational evaluation of optimal solution value estimation procedures (Q1104245) (← links)
- Aggregation of constraints in integer programming (Q1108194) (← links)
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem (Q1108931) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- Heuristics and their design: A survey (Q1152854) (← links)
- Multicriteria dynamic programming with an application to the integer case (Q1158349) (← links)
- An interactive dynamic programming approach to multicriteria discrete programming (Q1169938) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- Value considerations in three-dimensional packing -- a heuristic procedure using the fractional knapsack problem (Q1330560) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- Dynamic tabu list management using the reverse elimination method (Q2366993) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality (Q3688105) (← links)
- Multicriteria integer programming: A (hybrid) dynamic programming recursive approach (Q3948895) (← links)