Simulated annealing: theory and applications
Simulated annealing: theory and applications
Optimization of resource location in hierarchical computer networks
Computers and Operations Research
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Modern heuristic techniques for combinatorial problems
Constraints Satisfaction through Recursive Neural Networks withMixed Penalties: a Case Study
Neural Processing Letters
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
Tabu Search
Figure-Ground Discrimination: A Combinatorial Optimization Approach
IEEE Transactions on Pattern Analysis and Machine Intelligence
Constraints Satisfaction through Recursive Neural Networks withMixed Penalties: a Case Study
Neural Processing Letters
The Express heuristic for probabilistically constrained integer problems
Journal of Heuristics
| Hi-index | 0.00 |
This paper investigates a real world assignment problem, whichslightly differs from the classical generalized assignment problem(GAP). The large-scale number of variables in the related 0-1 linearprogram makes the use of commercial optimization packages impractical.We present here a metaheuristic using simulated annealing. It is basedon successive reductions of the search space by identification oflocally active constraints. Our approach employs a heuristicprocedure to compute an initial (feasible or infeasible) 0/1 solution,and a double-criterion acceptance rule. The performance of thealgorithm is demonstrated on real data sets.