Pages that link to "Item:Q3854926"

The following pages link to A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926):

Displaying 16 items.

• Optimal sequential inspection policies (Q646686) (← links)
• A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
• Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms (Q1096544) (← links)
• The knapsack problem with generalized upper bounds (Q1122484) (← links)
• On maintenance scheduling of production units (Q1159562) (← links)
• LP relaxation of the two dimensional knapsack problem with box and GUB constraints (Q1266739) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• Continuous maximin knapsack problems with GLB constraints (Q3028718) (← links)
• AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (Q3312019) (← links)
• An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277) (← links)
• A dual approach for the continuous collapsing knapsack problem (Q3778543) (← links)
• Minmax linear knapsack problem with grouped variables and gub (Q3835625) (← links)
• Solution techniques for some allocation problems (Q3955156) (← links)
• The integer programming background of a stochastic integer programming algorithm of dentcheva‐prékopa‐ruszczyński (Q4709738) (← links)