Pages that link to "Item:Q674439"
From MaRDI portal
The following pages link to Lifting cover inequalities for the precedence-constrained knapsack problem (Q674439):
Displaying 25 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)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- On separating cover inequalities for the multidimensional knapsack problem (Q858283) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Lifting valid inequalities for the precedence constrained knapsack problem (Q1806031) (← links)
- Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs (Q2069234) (← 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)
- A pegging approach to the precedence-constrained knapsack problem (Q2371351) (← links)
- Primal-dual algorithms for precedence constrained covering problems (Q2408089) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- Simple lifted cover inequalities and hard knapsack problems (Q2581317) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Large-scale multi-period precedence constrained knapsack problem: a mining application (Q2883587) (← links)
- Primal-Dual Algorithms for Precedence Constrained Covering Problems (Q3453300) (← links)
- Stronger Inference through Implied Literals from Conflicts and Knapsack Covers (Q4922900) (← links)
- Integer programming approach to the printed circuit board grouping problem (Q5460557) (← links)
- Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems (Q6164359) (← links)