Pages that link to "Item:Q1168894"

The following pages link to A note on the knapsack problem with special ordered sets (Q1168894):

Displaying 28 items.

• Maximizing revenue of end of life items in retail stores (Q323500) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
• A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
• Capacitated emergency facility siting with multiple levels of backup (Q689256) (← links)
• A fast algorithm for the linear multiple-choice knapsack problem (Q800227) (← links)
• Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Solving the linear multiple choice knapsack problem with two objectives: Profit and equity (Q839491) (← links)
• Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
• The capacitated maximal covering location problem with backup service (Q920016) (← links)
• Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
• Knapsack problems with setups (Q1041933) (← links)
• Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
• A new Lagrangian relaxation approach to the generalized assignment problem (Q1088908) (← 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)
• Computational comparison on the partitioning strategies in multiple choice integer programming (Q1266577) (← links)
• Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
• Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165) (← links)
• Exact approaches for the knapsack problem with setups (Q1652523) (← links)
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
• Selecting hierarchical facilities in a service-operations environment (Q1873008) (← links)
• Multiple-choice knapsack constraint in graphical models (Q2170205) (← links)
• Optimal multicast route packing (Q2378485) (← links)
• A versatile algorithm for assembly line balancing (Q2383104) (← links)
• Continuous maximin knapsack problems with GLB constraints (Q3028718) (← links)
• Minmax linear knapsack problem with grouped variables and gub (Q3835625) (← links)