Pages that link to "Item:Q1569935"

The following pages link to New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935):

Displaying 21 items.

• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• An exact algorithm for the knapsack sharing problem (Q2485179) (← links)
• Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
• Tree knapsack approaches for local access network design (Q2503262) (← links)
• Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244) (← links)
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← links)
• An improved typology of cutting and packing problems (Q2643945) (← links)
• Binary trie coding scheme: an intelligent genetic algorithm avoiding premature convergence (Q2855721) (← links)
• Sensitivity analysis to perturbations of the weight of a subset of items: the single knapsack case study (Q2883592) (← links)
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
• Computing and Selecting ε-Efficient Solutions of {0, 1}-Knapsack Problems (Q3556579) (← links)
• Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem (Q3796962) (← links)
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems (Q4393124) (← links)
• (Q4458134) (← links)
• Reliable Dynamic Packet Scheduling over Lossy Real-Time Wireless Networks (Q5089111) (← links)
• Random knapsack in expected polynomial time (Q5917572) (← links)
• A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)
• Hybrid genetic algorithm for undirected traveling salesman problems with profits (Q6139377) (← links)
• A heuristic approach for the integrated production-transportation problem with process flexibility (Q6551098) (← links)
• Branch-and-bound and dynamic programming approaches for the knapsack problem (Q6633256) (← links)