Zobrazeno 1 - 10
of 86
pro vyhledávání: '"TEGHEM, Jacques"'
Autor:
Lust, Thibaut, Teghem, Jacques
The knapsack problem (KP) and its multidimensional version (MKP) are basic problems in combinatorial optimization. In this paper we consider their multiobjective extension (MOKP and MOMKP), for which the aim is to obtain or to approximate the set of
Externí odkaz:
http://arxiv.org/abs/1007.4063
Autor:
Lust, Thibaut, Teghem, Jacques
We consider the following problem: to decompose a nonnegative integer matrix into a linear combination of binary matrices that respect the consecutive ones prop- erty. This problem occurs in the radiotherapy treatment of cancer. The nonnegative integ
Externí odkaz:
http://arxiv.org/abs/1006.1031
Publikováno v:
Foundations of Computing and Decision Sciences, Vol 44, Iss 2, Pp 179-211 (2019)
We consider a single-machine bi-objective scheduling problem with rejection. In this problem, it is possible to reject some jobs. Four algorithms are provided to solve this scheduling problem. The two objectives are the total weighted completion time
Externí odkaz:
https://doaj.org/article/89a90f2054ea4023a01586fe9d3d07e7
Publikováno v:
International Journal of Production Research. Feb2018, Vol. 56 Issue 3, p1030-1053. 24p. 17 Charts, 13 Graphs.
Publikováno v:
In IFAC PapersOnLine 2016 49(12):1614-1619
Autor:
Souai, Nadia, Teghem, Jacques
Publikováno v:
In European Journal of Operational Research 2009 199(3):674-683
Relationships between Pareto optimality in multi-objective 0–1 linear programming and DEA efficiency
Autor:
Yougbaré, Jacob W., Teghem, Jacques
Publikováno v:
In European Journal of Operational Research 2007 183(2):608-617
Publikováno v:
In European Journal of Operational Research 2007 179(3):709-722
Publikováno v:
In European Journal of Operational Research 2007 177(3):1703-1719
Publikováno v:
In Computers and Operations Research 2007 34(11):3346-3361