Pages that link to "Item:Q1390271"

The following pages link to An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271):

Displaying 39 items.

• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems (Q443043) (← links)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← links)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights (Q965587) (← links)
• Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
• An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow (Q1025254) (← links)
• A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
• Performance analysis of a parallel Dantzig-Wolfe decomposition algorithm for linear programming. (Q1416351) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
• Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
• An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
• Where are the hard knapsack problems? (Q1772862) (← links)
• Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers (Q1776965) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• Inversion of convection-diffusion equation with discrete sources (Q2129202) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
• Heuristic and exact algorithms for the max-min optimization of the multi-scenario knapsack problem (Q2462550) (← links)
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
• An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
• The two-dimensional bin packing problem with variable bin sizes and costs (Q2568334) (← links)
• An empirical investigation on parallelization strategies for scatter search (Q2570149) (← links)
• An exact algorithm for the budget-constrained multiple knapsack problem (Q2885555) (← links)
• Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• Uncertainty feature optimization: An implicit paradigm for problems with noisy data (Q3008922) (← links)
• A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
• Using fuzzy numbers in knapsack problems (Q5954834) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)