Pages that link to "Item:Q4158817"

The following pages link to THE MULTIPLE-CHOICE KNAPSACK PROBLEM (Q4158817):

Displaying 20 items.

• An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371) (← links)
• Branch-and-cut for complementarity-constrained optimization (Q482112) (← links)
• Optimal sequential inspection policies (Q646686) (← links)
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← 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)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• LP relaxation of the two dimensional knapsack problem with box and GUB constraints (Q1266739) (← links)
• Models for representing piecewise linear cost functions (Q1433660) (← links)
• Heuristic allocation based on a dynamic programming state-space representation (Q1602778) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Complex-demand scheduling problem with application in smart grid (Q1727389) (← links)
• A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
• A polyhedral study of the semi-continuous knapsack problem (Q2434996) (← links)
• Continuous maximin knapsack problems with GLB constraints (Q3028718) (← 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)
• A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818) (← links)
• New classes of facets for complementarity knapsack problems (Q6585265) (← links)
• Relaxations and cutting planes for linear programs with complementarity constraints (Q6607018) (← links)