Pages that link to "Item:Q2195439"

The following pages link to A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439):

Displaying 11 items.

• A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• Tabu search tutorial. A graph drawing application (Q1979170) (← links)
• A comparative analysis of two matheuristics by means of merged local optima networks (Q2029302) (← links)
• Dual mean field annealing scheme for binary optimization under linear constraints (Q2183203) (← links)
• Corrigendum to: ``Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems'' (Q2184176) (← links)
• Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
• Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem (Q6091423) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)