Pages that link to "Item:Q1806031"

The following pages link to Lifting valid inequalities for the precedence constrained knapsack problem (Q1806031):

Displaying 13 items.

• Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
• The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
• An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Knapsack polytopes: a survey (Q827125) (← links)
• Vehicle routing problem with time windows and a limited number of vehicles. (Q1812003) (← links)
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem (Q2270449) (← links)
• Production planning and scheduling in mining scenarios under IPCC mining systems (Q2289898) (← links)
• Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
• Approximations for the two-machine cross-docking flow shop problem (Q2446855) (← links)
• Large-scale multi-period precedence constrained knapsack problem: A mining application (Q2883587) (← links)
• Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)