Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits

Cites Work

Unnamed Item
A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows
An effective GRASP and tabu search for the 0-1 quadratic knapsack problem
An iterated ``hyperplane exploration approach for the quadratic knapsack problem
Carousel greedy: a generalized greedy algorithm with applications in optimization
Approximation of the quadratic knapsack problem
Approximation of knapsack problems with conflict and forcing graphs
Bin packing problem with conflicts and item fragmentation
A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
Knapsack problems -- an overview of recent advances. I: Single knapsack problems
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
A hybrid evolutionary algorithm for the capacitated minimum spanning tree problem
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
The knapsack problem with forfeits
A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
A logarithmic descent direction algorithm for the quadratic knapsack problem
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Parametric convex quadratic relaxation of the quadratic knapsack problem
A threshold search based memetic algorithm for the disjunctively constrained knapsack problem
A cut-and-branch algorithm for the quadratic knapsack problem
Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts
A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
Approximation of the Quadratic Knapsack Problem
Exact Solution of the Quadratic Knapsack Problem
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem
0-1 Quadratic Knapsack Problems: An Exact Approach Based on a $t$-Linearization
An evolutionary algorithm for the multi‐objective pick‐up and delivery pollution‐routing problem
A multi‐objective hybrid evolutionary search algorithm for parallel production line balancing problem including disassembly and assembly tasks
Location‐routing problem: a classification of recent research
The knapsack problem with forfeit sets

This page was built for publication: Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits