Dividing the set of nodes into clusters in the well-known traveling salesman problem results in the generalized traveling salesman problem which seeking a tour with minimum cost p...
Mehmet Fatih Tasgetiren, Ponnuthurai N. Suganthan,...
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
This paper treats the solution of nonlinear optimization problems involving discrete decision variables, also known as generalized disjunctive programming (GDP) or mixed-integer n...
— Parametric excitation walking is one of methods that realize a passive dynamic like walking on the level ground. In parametric excitation walking, up-and-down motion of the cen...
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...