Pages that link to "Item:Q2029024"
From MaRDI portal
The following pages link to A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024):
Displaying 27 items.
- Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems (Q733985) (← links)
- A modified descent method-based heuristic for binary quadratic knapsack problems with conflict graphs (Q829173) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← 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)
- Multiple-choice knapsack constraint in graphical models (Q2170205) (← links)
- A matheuristic for a customer assignment problem in direct marketing (Q2171614) (← links)
- A threshold search based memetic algorithm for the disjunctively constrained knapsack problem (Q2669554) (← links)
- Cover by disjoint cliques cuts for the knapsack problem with conflicting items (Q2670441) (← links)
- Fair allocation of indivisible items with conflict graphs (Q2701390) (← links)
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
- A branch-and-price algorithm for the bin packing problem with conflicts (Q2899132) (← links)
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph (Q4599315) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- Bin Packing Problem with Time Lags (Q5106420) (← 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)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- Knapsack: connectedness, path, and shortest-path (Q6547953) (← links)
- Exact and heuristic solution approaches for the generalized independent set problem (Q6551177) (← links)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← 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)
- Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets (Q6667807) (← links)
