6 citations · 14 across the 6 of their papers we have counts for
6 papers
A Memetic Algorithm for the Linear Ordering Problem with Cumulative Costs
Tao Ye, Kan Zhou, Zhipeng Lu +1
This paper introduces an effective memetic algorithm for the linear ordering problem with cumulative costs. The proposed algorithm combines an order-based recombination operator wi…
A Multi-parent Memetic Algorithm for the Linear Ordering Problem
Tao Ye, Tao Wang, Zhipeng Lu +1
In this paper, we present a multi-parent memetic algorithm (denoted by MPM) for solving the classic Linear Ordering Problem (LOP). The MPM algorithm integrates in particular a mult…
Iterated Tabu Search Algorithm for Packing Unequal Circles in a Circle
Tao Ye, Wenqi Huang, Zhipeng Lu
This paper presents an Iterated Tabu Search algorithm (denoted by ITS-PUCC) for solving the problem of Packing Unequal Circles in a Circle. The algorithm exploits the continuous an…
Integrating tabu search and VLSN search to develop enhanced algorithms: A case study using bipartite boolean quadratic programs
Fred Glover, Tao Ye, Abraham P. Punnen +1
The bipartite boolean quadratic programming problem (BBQP) is a generalization of the well studied boolean quadratic programming problem. The model has a variety of real life appli…
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem
Wenqi Huang, Tao Ye, Duanbing Chen
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given in…
Bottom-Left Placement Theorem for Rectangle Packing
Wenqi Huang, Tao Ye, Duanbing Chen
This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rect…