Pages that link to "Item:Q3315277"

The following pages link to An O(n) algorithm for the multiple-choice knapsack linear program (Q3315277):

Displaying 36 items.

• Measuring the power of soft correlated equilibrium in 2-facility simple non-increasing linear congestion games (Q301158) (← links)
• Generalized correlated equilibrium for two-person games in extensive form with perfect information (Q539469) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Optimal sequential inspection policies (Q646686) (← links)
• Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems (Q761347) (← links)
• A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
• Minimizing the weighted number of tardy jobs on a single machine with release dates (Q852934) (← links)
• A faster polynomial algorithm for the unbalanced Hitchcock transportation problem (Q1003485) (← links)
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← links)
• LP relaxation of the two dimensional knapsack problem with box and GUB constraints (Q1266739) (← links)
• Relaxation heuristics for a generalized assignment problem (Q1278258) (← links)
• A linear-time algorithm for the bottleneck transportation problem with a fixed number of sources (Q1306364) (← links)
• The capacity expansion problem in the service industry (Q1321810) (← links)
• A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
• Minimizing the weighted number of tardy jobs on a two-machine flow shop. (Q1413849) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Worst-case analysis of the greedy algorithm for a generalization of the maximum \(p\)-facility location problem (Q1577475) (← links)
• Exact approaches for the knapsack problem with setups (Q1652523) (← links)
• Lagrangean/surrogate relaxation for generalized assignment problems (Q1809834) (← links)
• Deriving expected values from probabilities of fuzzy subsets (Q1814257) (← links)
• The linear multiple choice knapsack problem (Q1825130) (← links)
• Minimizing the weighted number of tardy jobs on parallel processors (Q1887912) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Multiple-choice knapsack constraint in graphical models (Q2170205) (← links)
• SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing (Q2242373) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• An optimal randomized algorithm for \(d\)-variate zonoid depth (Q2477199) (← links)
• Continuous maximin knapsack problems with GLB constraints (Q3028718) (← links)
• (Q3329226) (← links)
• A dual approach for the continuous collapsing knapsack problem (Q3778543) (← links)
• Minmax linear knapsack problem with grouped variables and gub (Q3835625) (← links)
• Budgeting with bounded multiple-choice constraints. (Q5928374) (← links)