Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 38 matches
- 2018
- 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) - 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
- 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
- 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) - 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
- 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
- Thibaut Lust, Jacques Teghem, Daniel Tuyttens:
Very Large-Scale Neighborhood Search for Solving Multiobjective Combinatorial Optimization Problems. EMO 2011: 254-268 - 2010
- 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) - 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) - Thibaut Lust, Jacques Teghem:
Two-phase Pareto local search for the biobjective traveling salesman problem. J. Heuristics 16(3): 475-510 (2010) - 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) - 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 - Thibaut Lust, Jacques Teghem:
Multiobjective decomposition of integer matrices: application to radiotherapy. CoRR abs/1006.1031 (2010) - Thibaut Lust, Jacques Teghem:
The multiobjective multidimensional knapsack problem: a survey and a new approach. CoRR abs/1007.4063 (2010) - 2009
- 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) - Thibaut Lust, Jacques Teghem:
Multiobjective Decomposition of Positive Integer Matrix: Application to Radiotherapy. EMO 2009: 335-349 - Jacques Teghem:
Multiple Objective Linear Programming. Decision-making Process 2009: 199-264 - Jacques Teghem:
Bi-Objective Assignment Problem. Encyclopedia of Optimization 2009: 288-293 - Jacques Teghem:
Multi-objective Combinatorial Optimization. Encyclopedia of Optimization 2009: 2437-2442 - Jacques Teghem:
Multi-objective Integer Linear Programming. Encyclopedia of Optimization 2009: 2448-2454 - 2008
- Thibaut Lust, Jacques Teghem:
MEMOTS: a memetic algorithm integrating tabu search for combinatorial multiobjective optimization. RAIRO Oper. Res. 42(1): 3-33 (2008) - 2007
- Samya Elaoud, Jacques Teghem, Bassem Bouaziz:
Genetic algorithms to solve the cover printing problem. Comput. Oper. Res. 34(11): 3346-3361 (2007) - Samya Elaoud, Taïcir Loukil, Jacques Teghem:
The Pareto fitness genetic algorithm: Test function study. Eur. J. Oper. Res. 177(3): 1703-1719 (2007) - 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) - 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
- 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
- Roman Slowinski, Jacques Teghem, Jyrki Wallenius:
Editorial. Eur. J. Oper. Res. 159(3) (2004) - 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
- Benedetto Matarazzo, Jacques Teghem:
O.R. for innovation and quality of life. Eur. J. Oper. Res. 139(2): 191-192 (2002) - 2000
- 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)
skipping 8 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-06-30 06:54 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint