Daniel Tuyttens

Available identifiers

Publication	Date of Publication	Type
A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem	2020-05-07	Paper
Variable and large neighborhood search to solve the multiobjective set covering problem	2017-06-27	Paper
Heuristics for exact nonnegative matrix factorization	2016-05-25	Paper
A bi‐objective approach to reschedule new jobs in a one machine model	2015-04-22	Paper
Towards an efficient resolution of printing problems	2015-04-09	Paper
Using a greedy random adaptative search procedure to solve the cover printing problem	2009-11-27	Paper
Metaheuristics in multiple objective optimization (Editorial)	2005-11-04	Paper
Performance of the MOSA method for the bicriteria assignment problem	2005-10-13	Paper
Solving multi-objective production scheduling problems using metaheuristics	2004-11-22	Paper
https://portal.mardi4nfdi.de/entity/Q4817406	2004-09-22	Paper
An interactive heuristic method for multi-objective combinatorial optimization	2000-07-09	Paper
MOSA method: a tool for solving multiobjective combinatorial optimization problems	2000-02-20	Paper
LSNNO, a FORTRAN subroutine for solving large-scale nonlinear network optimization problems	1998-02-09	Paper
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search	1995-05-15	Paper
On iterative algorithms for linear least squares problems with bound constraints	1991-01-01	Paper
On large scale nonlinear network optimization	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3722270	1986-01-01	Paper

This page was built for person: Daniel Tuyttens