The following pages link to Mhand Hifi (Q174583):
Displaying 50 items.
- An exact decomposition algorithm for the generalized knapsack sharing problem (Q322972) (← links)
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems (Q429470) (← links)
- Solving the circular open dimension problem by using separate beams and look-ahead strategies (Q502428) (← links)
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems (Q604802) (← links)
- A literature review on circle and sphere packing problems: models and methodologies (Q606170) (← links)
- The knapsack sharing problem: an exact algorithm (Q702349) (← links)
- A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem (Q840573) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- Beam search and non-linear programming tools for the circular packing problem (Q843379) (← links)
- Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- A beam search algorithm for the circular packing problem (Q960400) (← links)
- A column generation method for the multiple-choice multi-dimensional knapsack problem (Q969718) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- Adaptive algorithms for circular cutting/packing problems (Q1040631) (← links)
- (Q1278247) (redirect page) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- A local search-based method for sphere packing problems (Q1634289) (← links)
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems (Q1768600) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- An efficient algorithm for the knapsack sharing problem (Q1812082) (← links)
- A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item (Q2384607) (← links)
- New upper bounds and exact methods for the knapsack sharing problem (Q2396494) (← links)
- Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
- An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems (Q2490166) (← links)
- A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem (Q2506174) (← links)
- An algorithm for the disjunctively constrained knapsack problem (Q2627241) (← links)
- A dynamic adaptive local search algorithm for the circular packing problem (Q2643959) (← links)
- (Q2861521) (← links)
- Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study (Q2883592) (← links)
- Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem (Q2901006) (← links)
- Adaptive beam search lookahead algorithms for the circular packing problem (Q3002543) (← links)
- A hybrid algorithm for the two-dimensional layout problem: the cases of regular and irregular shapes (Q3044033) (← links)
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems (Q3157808) (← links)
- A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems (Q3195349) (← links)
- A reactive local search-based algorithm for the disjunctively constrained knapsack problem (Q3418859) (← links)
- Sensitivity analysis of the knapsack sharing problem: perturbation of the profit of an item (Q3502135) (← links)
- A genetic algorithm-based heuristic for solving the weighted maximum independent set and some equivalent problems (Q4347406) (← links)
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm (Q4367021) (← links)
- Approximate algorithms for the container loading problem (Q4468894) (← links)
