Pages that link to "Item:Q1742610"

The following pages link to The core concept for the Multidimensional Knapsack problem (Q1742610):

Displaying 19 items.

• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958) (← links)
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem (Q542002) (← 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)
• Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
• Bringing order into the neighborhoods: Relaxation guided variable neighborhood search (Q953317) (← links)
• Variable neighbourhood search: methods and applications (Q970194) (← links)
• Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
• An ILP formulation and genetic algorithm for the maximum degree-bounded connected subgraph problem (Q988336) (← links)
• Variable neighbourhood search: Methods and applications (Q1029572) (← links)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
• CORAL: an exact algorithm for the multidimensional knapsack problem (Q2815454) (← links)
• The multidimensional knapsack problem: structure and algorithms (Q2899058) (← links)
• Combining (Integer) Linear Programming Techniques and Metaheuristics for Combinatorial Optimization (Q2950518) (← links)
• LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
• Optimizing a binary integer program by identifying its optimal core problem -- a new optimization concept applied to the multidimensional knapsack problem (Q6629013) (← links)