Pages that link to "Item:Q3789335"

The following pages link to A New Algorithm for the 0-1 Knapsack Problem (Q3789335):

Displaying 50 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)
• An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable (Q645559) (← links)
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
• An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
• Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← 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)
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core (Q1044419) (← links)
• An improved direct descent algorithm for binary knapsack problems (Q1115799) (← links)
• Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
• An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229) (← links)
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
• A computational note on the Martello-Toth knapsack algorithm (Q1328611) (← links)
• A branch-and-bound approach for spare unit allocation in a series system (Q1333525) (← links)
• Simple but efficient approaches for the collapsing knapsack problem (Q1364474) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• The bottleneck generalized assignment problem (Q1388853) (← links)
• Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth (Q1388884) (← links)
• An expanding-core algorithm for the exact \(0-1\) knapsack problem (Q1390271) (← 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)
• Performance evaluation of evolutionary class of algorithms -- an application to 0-1 knapsack problem (Q1596747) (← links)
• New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
• An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
• Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← 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)
• Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
• Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
• Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
• An efficient algorithm of dead-end controls for solving combinatorial optimization problems (Q2069680) (← links)
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← 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)
• Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
• A note on upper bounds to the robust knapsack problem with discrete scenarios (Q2259050) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Optimal experimental design for combinatorial problems (Q2365318) (← links)
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
• An efficient algorithm for the collapsing knapsack problem (Q2489216) (← links)
• A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances (Q2629710) (← 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)
• (Q3570781) (← links)