Pages that link to "Item:Q875412"

The following pages link to Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem (Q875412):

Displaying 16 items.

• Procedures for the bin packing problem with precedence constraints (Q322561) (← links)
• Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items (Q490206) (← links)
• A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
• Branch-and-cut for linear programs with overlapping SOS1 constraints (Q1646682) (← links)
• Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
• Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
• A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
• A Fast Large Neighborhood Search for Disjunctively Constrained Knapsack Problems (Q3195349) (← links)
• A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)
• A Fast Algorithm for Knapsack Problem with Conflict Graph (Q5024916) (← links)
• Min-Sup-Min Robust Combinatorial Optimization with Few Recourse Solutions (Q5106418) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)