![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
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
no matches
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 18 matches
- 2016
- Paula Amaral
, Tiago Cardal Pais:
Compromise ratio with weighting functions in a Tabu Search multi-criteria approach to examination timetabling. Comput. Oper. Res. 72: 160-174 (2016) - Federico Cabassi, Marco Locatelli:
Computational investigation of simple memetic approaches for continuous global optimization. Comput. Oper. Res. 72: 50-70 (2016) - Gökhan Ceyhan
, Özgür Özpeynirci
:
A branch and price algorithm for the pharmacy duty scheduling problem. Comput. Oper. Res. 72: 175-182 (2016) - F. Dong, J. R. Deglise-Hawkinson, Mark P. Van Oyen
, D. J. Singer:
Dynamic control of a closed two-stage queueing network for outfitting process in shipbuilding. Comput. Oper. Res. 72: 1-11 (2016) - Veaceslav Ghilas
, Emrah Demir
, Tom Van Woensel
:
An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines. Comput. Oper. Res. 72: 12-30 (2016) - Jie He, Qingguo Li
, Dehua Xu
:
Scheduling two parallel machines with machine-dependent availabilities. Comput. Oper. Res. 72: 31-42 (2016) - Abbasali Jafari
, Hassan Khademi-Zare, Mohammad Mehdi Lotfi, Reza Tavakkoli-Moghaddam
:
A note on "minimizing makespan in three machine flow shop with deteriorating jobs". Comput. Oper. Res. 72: 93-96 (2016) - Yacine Laalaoui, Rym M'Hallah
:
A binary multiple knapsack model for single machine scheduling with machine unavailability. Comput. Oper. Res. 72: 71-82 (2016) - Xiangjing Lai, Jin-Kao Hao:
A tabu search based memetic algorithm for the max-mean dispersion problem. Comput. Oper. Res. 72: 118-127 (2016) - Wouter Lefever
, El-Houssaine Aghezzaf
, Khaled Hadj-Hamou
:
A convex optimization approach for solving the single-vehicle cyclic inventory routing problem. Comput. Oper. Res. 72: 97-106 (2016) - Deming Lei, Xiuping Guo:
Variable neighborhood search for the second type of two-sided assembly line balancing problem. Comput. Oper. Res. 72: 183-188 (2016) - Markus Leitner
, Ivana Ljubic
, Markus Sinnl
, Axel Werner:
ILP heuristics and a new exact method for bi-objective 0/1 ILPs: Application to FTTx-network design. Comput. Oper. Res. 72: 128-146 (2016) - Yan Li
, Nan Kong, Mengnan Chen, Qipeng P. Zheng
:
Optimal physician assignment and patient demand allocation in an outpatient care network. Comput. Oper. Res. 72: 107-117 (2016) - Hsien-Jen Lin:
Investing in lead-time variability reduction in a collaborative vendor-buyer supply chain model with stochastic lead time. Comput. Oper. Res. 72: 43-49 (2016) - Jian-hua Lin
, Min Liu, Jinghua Hao, Shenglong Jiang:
A multi-objective optimization approach for integrated production planning under interval uncertainties in the steel industry. Comput. Oper. Res. 72: 189-203 (2016) - Lucas de Oliveira
, Cid C. de Souza
, Tallys H. Yunes:
Lower bounds for large traveling umpire instances: New valid inequalities and a branch-and-cut algorithm. Comput. Oper. Res. 72: 147-159 (2016) - Vladimir Rankovic, Mikica Drenovak, Branko Urosevic
, Ranko Jelic:
Mean-univariate GARCH VaR portfolio optimization: Actual portfolio approach. Comput. Oper. Res. 72: 83-92 (2016) - Banu Soylu, Gazi Bilal Yildiz:
An exact algorithm for biobjective mixed integer linear programming problems. Comput. Oper. Res. 72: 204-213 (2016)
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-08-20 00:15 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