Pages that link to "Item:Q1569935"
From MaRDI portal
The following pages link to New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935):
Displayed 27 items.
- Exact solution of a class of nonlinear knapsack problems (Q813968) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- The 0-1 knapsack problem with fuzzy data (Q1001155) (← links)
- Lagrangean relaxation for the capacitated hub location problem with single assignment (Q1027993) (← links)
- A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← links)
- A cooperative local search-based algorithm for the multiple-scenario max-min knapsack problem (Q1039776) (← links)
- Heuristics for the 0-1 multidimensional knapsack problem (Q1042198) (← links)
- Average performance of greedy heuristics for the integer knapsack problem. (Q1420409) (← links)
- The computation of the worst conditional expectation. (Q1427561) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← 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)
- An experimental study of random knapsack problems (Q2369879) (← links)
- Solving the Knapsack problem with imprecise weight coefficients using genetic algorithms (Q2456412) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- 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)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)