Pages that link to "Item:Q2899058"

The following pages link to The Multidimensional Knapsack Problem: Structure and Algorithms (Q2899058):

Displaying 31 items.

• A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
• Decomposition based hybrid metaheuristics (Q319285) (← links)
• Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems (Q319373) (← links)
• Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
• Improving problem reduction for 0-1 multidimensional knapsack problems with valid inequalities (Q342340) (← links)
• A Modified Binary Particle Swarm Optimization for Knapsack Problems (Q387477) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← 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)
• Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
• A randomized heuristic repair for the multidimensional knapsack problem (Q828650) (← links)
• Solving large 0-1 multidimensional knapsack problems by a new simplified binary artificial fish swarm algorithm (Q894546) (← links)
• Generalized average shadow prices and bottlenecks (Q1616793) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
• Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
• Dichotomous binary differential evolution for knapsack problems (Q1793333) (← links)
• A memetic Lagrangian heuristic for the 0-1 multidimensional knapsack problem (Q1956060) (← links)
• Revisiting surrogate relaxation for the multidimensional knapsack problem (Q2102833) (← links)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
• On the complexity of separation from the knapsack polytope (Q2164691) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• Inbound and outbound flow integration for cross-docking operations (Q2240064) (← links)
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem (Q2281727) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• Integrating workload smoothing and inventory reduction in three intermodal logistics platforms of a European car manufacturer (Q2329718) (← links)
• A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
• CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
• An Iterated Dual Substitution Approach for Binary Integer Programming Problems Under the Min-Max Regret Criterion (Q5057998) (← links)
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)