A new novel local search integer-programming-based heuristic for PCB assembly on collect-and-place machines.
Anupam SethDiego KlabjanPlacid M. FerreiraPublished in: Math. Program. Comput. (2016)
Keyphrases
- integer programming
- lagrangian relaxation
- printed circuit boards
- set covering
- optimal solution
- packing problem
- set covering problem
- search algorithm
- np hard
- tabu search
- constraint programming
- combinatorial optimization
- linear programming relaxation
- search heuristics
- linear programming
- ai planning
- simulated annealing
- search procedure
- domain independent planning
- search strategies
- column generation
- assembly process
- integer programming formulations
- job shop scheduling problem
- facility location
- valid inequalities
- network flow
- production planning
- memetic algorithm
- lp relaxation
- search space
- metaheuristic
- cutting plane
- tree search
- branch and bound
- vehicle routing problem with time windows
- genetic algorithm
- dynamic programming
- dantzig wolfe decomposition
- feasible solution
- round robin tournament
- constraint satisfaction
- cutting plane algorithm
- computational complexity
- objective function
- linear program
- search procedures
- global search
- mixed integer programming