default search action
Jacques Teghem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j24]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic. Ann. Oper. Res. 267(1-2): 101-134 (2018) - [j23]Manuel Mateo, Jacques Teghem, Daniel Tuyttens:
A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs. Int. J. Prod. Res. 56(3): 1030-1053 (2018) - 2014
- [j22]Jacques Teghem, Daniel Tuyttens:
A bi-objective approach to reschedule new jobs in a one machine model. Int. Trans. Oper. Res. 21(6): 871-898 (2014) - 2013
- [j21]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints. Int. Trans. Oper. Res. 20(2): 213-232 (2013) - [j20]Emna Dhouib, Jacques Teghem, Taïcir Loukil:
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints. J. Math. Model. Algorithms 12(1): 85-99 (2013) - 2012
- [j19]Thibaut Lust, Jacques Teghem:
The multiobjective multidimensional knapsack problem: a survey and a new approach. Int. Trans. Oper. Res. 19(4): 495-520 (2012) - 2011
- [c2]Thibaut Lust, Jacques Teghem, Daniel Tuyttens:
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. EMO 2011: 254-268 - 2010
- [j18]Samya Elaoud, Jacques Teghem, Taïcir Loukil:
Multiple crossover genetic algorithm for the multiobjective traveling salesman problem. Electron. Notes Discret. Math. 36: 939-946 (2010) - [j17]Jacques Teghem:
Metaheuristics. From Design to Implementation, El-Ghazali Talbi. John Wiley & Sons Inc. (2009). XXI + 593 pp., Publication 978-0-470-27858-1. Eur. J. Oper. Res. 205(2): 486-487 (2010) - [j16]Thibaut Lust, Jacques Teghem:
Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3): 475-510 (2010) - [j15]Abdeljawed Sadok, Jacques Teghem, Habib Chabchoub:
A hybrid grouping genetic algorithm for the inventory routing problem with multi-tours of the vehicle. Int. J. Comb. Optim. Probl. Informatics 1(2): 42-61 (2010) - [p5]Thibaut Lust, Jacques Teghem:
The Multiobjective Traveling Salesman Problem: A Survey and a New Approach. Advances in Multi-Objective Nature Inspired Computing 2010: 119-141 - [i2]Thibaut Lust, Jacques Teghem:
Multiobjective decomposition of integer matrices: application to radiotherapy. CoRR abs/1006.1031 (2010) - [i1]Thibaut Lust, Jacques Teghem:
The multiobjective multidimensional knapsack problem: a survey and a new approach. CoRR abs/1007.4063 (2010)
2000 – 2009
- 2009
- [j14]Nadia Souai, Jacques Teghem:
Genetic algorithm based approach for the integrated airline crew-pairing and rostering problem. Eur. J. Oper. Res. 199(3): 674-683 (2009) - [c1]Thibaut Lust, Jacques Teghem:
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy. EMO 2009: 335-349 - [p4]Jacques Teghem:
Multiple Objective Linear Programming. Decision-making Process 2009: 199-264 - [r3]Jacques Teghem:
Bi-Objective Assignment Problem. Encyclopedia of Optimization 2009: 288-293 - [r2]Jacques Teghem:
Multi-objective Combinatorial Optimization. Encyclopedia of Optimization 2009: 2437-2442 - [r1]Jacques Teghem:
Multi-objective Integer Linear Programming. Encyclopedia of Optimization 2009: 2448-2454 - 2008
- [j13]Thibaut Lust, Jacques Teghem:
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. RAIRO Oper. Res. 42(1): 3-33 (2008) - 2007
- [j12]Samya Elaoud, Jacques Teghem, Bassem Bouaziz
:
Genetic algorithms to solve the cover printing problem. Comput. Oper. Res. 34(11): 3346-3361 (2007) - [j11]Samya Elaoud, Taïcir Loukil, Jacques Teghem:
The Pareto fitness genetic algorithm: Test function study. Eur. J. Oper. Res. 177(3): 1703-1719 (2007) - [j10]Taïcir Loukil, Jacques Teghem, Philippe Fortemps
A multi-objective production scheduling case study solved by simulated annealing. Eur. J. Oper. Res. 179(3): 709-722 (2007) - [j9]Jacob W. Yougbaré, Jacques Teghem:
Relationships between Pareto optimality in multi-objective 0-1 linear programming and DEA efficiency. Eur. J. Oper. Res. 183(2): 608-617 (2007) - 2005
- [j8]Taïcir Loukil, Jacques Teghem, Daniel Tuyttens:
Solving multi-objective production scheduling problems using metaheuristics. Eur. J. Oper. Res. 161(1): 42-61 (2005) - 2004
- [j7]Roman Slowinski, Jacques Teghem, Jyrki Wallenius:
Editorial. Eur. J. Oper. Res. 159(3) (2004) - [p3]Daniel Tuyttens, Jacques Teghem, Nasser El-Sherbeny:
A Particular Multiobjective Vehicle Routing Problem Solved by Simulated Annealing. Metaheuristics for Multiobjective Optimisation 2004: 133-152 - 2002
- [j6]Benedetto Matarazzo, Jacques Teghem:
O.R. for innovation and quality of life. Eur. J. Oper. Res. 139(2): 191-192 (2002) - 2000
- [j5]Jacques Teghem, Daniel Tuyttens, Ekunda L. Ulungu:
An interactive heuristic method for multi-objective combinatorial optimization. Comput. Oper. Res. 27(7-8): 621-634 (2000) - [j4]Daniel Tuyttens, Jacques Teghem, Philippe Fortemps
Performance of the MOSA Method for the Bicriteria Assignment Problem. J. Heuristics 6(3): 295-310 (2000)
1990 – 1999
- 1998
- [j3]M. Visée, Jacques Teghem, Marc Pirlot
Two-phases Method and Branch and Bound Procedures to Solve the Bi-objective Knapsack Problem. J. Glob. Optim. 12(2): 139-155 (1998) - [j2]Ekunda L. Ulungu, Jacques Teghem, Ch. Ost:
Efficiency of interactive multi-objective simulated annealing through a case study. J. Oper. Res. Soc. 49(10): 1044-1050 (1998) - 1994
- [j1]Daniel Tuyttens, Marc Pirlot
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. Ann. Oper. Res. 50(1): 575-607 (1994) - 1992
- [p2]Jacques Teghem, Jean-Marie Charlet:
Use of "Rough Sets" Method to Draw Premonitory Factors for Earthquakes by Emphasing Gas Geochemistry: The Case of a Low Seismic Activity Context, in Belgium. Intelligent Decision Support 1992: 165-179 - [p1]Jacques Teghem, Mohammed Benjelloun:
Some Experiments to Compare Rough Sets Theory and Ordinal Statistical Methods. Intelligent Decision Support 1992: 267-286
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: