The following pages link to Wenqi Huang (Q322526):
Displaying 50 items.
- Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
- Quasi-physical global optimization method for solving the equal circle packing problem (Q350865) (← links)
- Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Global optimization method for finding dense packings of equal circles in a circle (Q541690) (← links)
- A quasi-human algorithm for solving the three-dimensional rectangular packing problem (Q543092) (← links)
- Greedy vacancy search algorithm for packing equal circles in a square (Q613329) (← links)
- A short note on a simple search heuristic for the diskspacking problem (Q702715) (← links)
- An efficient placement heuristic for three-dimensional rectangular packing (Q709132) (← links)
- A new heuristic algorithm for rectangle packing (Q883288) (← links)
- A new heuristic algorithm for cuboids packing with no orientation constraints (Q954042) (← links)
- A quasi-physical method for solving the scheduling problem of space utilization (Q1180006) (← links)
- A basic algorithm for computer-aided design of material arrangement (Q1192502) (← links)
- Quasiphysical and quasisociological algorithm Solar for solving SAT problem (Q1610034) (← links)
- An algorithm based on tabu search for satisfiability problem (Q1613279) (← links)
- An efficient deterministic heuristic for two-dimensional rectangular packing (Q1762123) (← links)
- An approximately fast algorithm for deciding the validity of disjunctive normal forms (DNFs) (Q1801736) (← links)
- A mathematic-physical approach to the satisfiability problem (Q1805394) (← links)
- A quasi-physical algorithm for solving the problem of a radar group monitoring an object group (Q1814827) (← links)
- An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- An improved shifting bottleneck procedure for the job shop scheduling problem (Q1879795) (← links)
- Two personification strategies for solving circles packing problem (Q1974210) (← links)
- Iterated tabu search for the circular open dimension problem (Q2253497) (← links)
- A pure quasi-human algorithm for solving the cuboid packing problem (Q2267001) (← links)
- A caving degree approach for the single container loading problem (Q2378453) (← links)
- PERM for solving circle packing problem (Q2459405) (← links)
- New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
- (Q2749198) (← links)
- (Q2749588) (← links)
- (Q2858878) (← links)
- (Q3170340) (← links)
- (Q3197320) (← links)
- (Q3366815) (← links)
- A local search method for permutation flow shop scheduling (Q3433488) (← links)
- (Q3445389) (← links)
- (Q3470462) (← links)
- (Q3487330) (← links)
- A NEW HEURISTIC ALGORITHM FOR CONSTRAINED RECTANGLE-PACKING PROBLEM (Q3503066) (← links)
- (Q3553692) (← links)
- Solving the single-container loading problem by a fast heuristic method (Q3562399) (← links)
- An Efficient Algorithm for Solving the Container Loading Problem (Q3611930) (← links)
- (Q3640390) (← links)
- (Q3670082) (← links)
- The hardness of the grid problemGi Under the Routine Resolution Method (Q3721813) (← links)
- (Q3753399) (← links)
- A DNF without Regular Shortest Consensus Path (Q3769994) (← links)
- (Q3778751) (← links)
- (Q3832552) (← links)
- (Q3836953) (← links)
