The following pages link to C. K. Wong (Q185075):
Displaying 23 items.
- The strong Hall property and symmetric chain orders (Q1301661) (← links)
- An experimental analysis of local minima to improve neighbourhood search. (Q1422374) (← links)
- Approximation of Boolean functions by local search (Q1424790) (← links)
- On the bounded domination number of tournaments (Q1567627) (← links)
- On avoidable and unavoidable claws (Q1584226) (← links)
- The convergence of stochastic algorithms solving flow shop scheduling (Q1608340) (← links)
- Two simulated annealing-based heuristics for the job shop scheduling problem (Q1806614) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- On the optimal four-way switch box routing structures of FPGA greedy routing architectures (Q4225389) (← links)
- (Q4232775) (← links)
- Onk-ary spanning trees of tournaments (Q4237726) (← links)
- (Q4247203) (← links)
- (Q4503942) (← links)
- (Q4536433) (← links)
- OBDD minimization based on two-level representation of Boolean functions (Q4571387) (← links)
- (Q4706511) (← links)
- (Q4897664) (← links)
- A Continuity Theorem for Fuchsian Groups (Q5609585) (← links)
- Rooted spanning trees in tournaments (Q5935602) (← links)
- The \(K_r\)-packing problem (Q5937570) (← links)
- On fixed edges and edge-reconstruction of series-parallel networks (Q5943041) (← links)
- Fast parallel heuristics for the job shop scheduling problem (Q5955476) (← links)
- Vertex ranking of asteroidal triple-free graphs (Q6487437) (← links)
