The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
In this paper, we study a bidding problem which can be modeled as a set packing problem. A simulated annealing heuristic with three local moves, including an embedded branch-and-b...
In this paper we present a method for creating scheduling heuristics for parallel proportional machine scheduling environment and arbitrary performance criteria. Genetic programmin...
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...