Pages that link to "Item:Q4599315"

The following pages link to A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315):

Displaying 30 items.

• On the product knapsack problem (Q1653266) (← 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)
• On the exact separation of cover inequalities of maximum-depth (Q2115307) (← links)
• Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
• Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect (Q2152905) (← links)
• Multiple-choice knapsack constraint in graphical models (Q2170205) (← links)
• A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
• Exact algorithms to minimize makespan on single and parallel batch processing machines (Q2183850) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
• Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
• Dual Inequalities for Stabilized Column Generation Revisited (Q2806874) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← 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)
• Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation (Q5086008) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Hybridizing adaptive large neighborhood search with kernel search: a new solution approach for the nurse routing problem with incompatible services and minimum demand (Q6056092) (← links)
• Minimum cost flow problem with conflicts (Q6065835) (← links)
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
• The knapsack problem with forfeit sets (Q6109304) (← links)
• Responsive strategic oscillation for solving the disjunctively constrained knapsack problem (Q6112824) (← links)
• CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
• Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)
• Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)
• On conflict-free cuts: algorithms and complexity (Q6602320) (← links)
• Tight bounds for budgeted maximum weight independent set in bipartite and perfect graphs (Q6657247) (← links)
• Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits (Q6659822) (← links)