The following pages link to Daniel Tuyttens (Q288238):
Displaying 18 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- (Q756371) (redirect page) (← links)
- On iterative algorithms for linear least squares problems with bound constraints (Q756372) (← links)
- On large scale nonlinear network optimization (Q908858) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search (Q1339162) (← links)
- An interactive heuristic method for multi-objective combinatorial optimization (Q1569903) (← links)
- Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem (Q2178110) (← links)
- Towards an efficient resolution of printing problems (Q2339840) (← links)
- Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
- Performance of the MOSA method for the bicriteria assignment problem (Q2567886) (← links)
- Metaheuristics in multiple objective optimization (Editorial) (Q2572857) (← links)
- (Q3722270) (← links)
- LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems (Q4371805) (← links)
- (Q4817406) (← links)
- MOSA method: a tool for solving multiobjective combinatorial optimization problems (Q4934175) (← links)
- A bi‐objective approach to reschedule new jobs in a one machine model (Q5246808) (← links)