![](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 27 matches
- 2019
- Vladimir L. Beresnev, Andrey A. Melnikov
:
Approximation of the competitive facility location problem with MIPs. Comput. Oper. Res. 104: 139-148 (2019) - Robert L. Burdett
, Paul Corry
, Prasad K. D. V. Yarlagadda
, Colin Murray Eustace, Simon Smith:
A flexible job shop scheduling approach with operators for coal export terminals. Comput. Oper. Res. 104: 15-36 (2019) - Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
:
Lorenz dominance based algorithms to solve a practical multiobjective problem. Comput. Oper. Res. 104: 1-14 (2019) - André B. Chassein, Anika Kinscherff:
Complexity of strict robust integer minimum cost flow problems: An overview and further results. Comput. Oper. Res. 104: 228-238 (2019) - Narcís Coll
, Marta Fort
, Joan Antoni Sellarès:
On the overlap area of a disk and a piecewise circular domain. Comput. Oper. Res. 104: 59-73 (2019) - Jesus O. Cunha
, Hugo Harry Kramer
, Rafael A. Melo
:
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. Comput. Oper. Res. 104: 149-158 (2019) - Weibin Dai, Jun Zhang, Xiaoqian Sun
, Sebastian Wandelt:
HUBBI: Iterative network design for incomplete hub location problems. Comput. Oper. Res. 104: 394-414 (2019) - Milad Keshvari Fard
, Laurent Alfandari:
Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem. Comput. Oper. Res. 104: 358-374 (2019) - Alberto Franzin
, Thomas Stützle
:
Revisiting simulated annealing: A component-based analysis. Comput. Oper. Res. 104: 191-206 (2019) - Aurélien Froger
, Jorge E. Mendoza, Ola Jabali
, Gilbert Laporte
:
Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. Comput. Oper. Res. 104: 256-294 (2019) - Xiaoxuan Hu
, Waiming Zhu
, Bo An, Peng Jin, Wei Xia:
A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem. Comput. Oper. Res. 104: 74-89 (2019) - Ming Liu
, Feng Chu
, Junkai He, Dapeng Yang
, Chengbin Chu
:
Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times. Comput. Oper. Res. 104: 37-48 (2019) - Ana Dolores López-Sánchez
, Jesús Sánchez-Oro, Alfredo García Hernández-Díaz:
GRASP and VNS for solving the p-next center problem. Comput. Oper. Res. 104: 295-303 (2019) - Milagros Loreto
, Y. Xu, David H. Kotval:
A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems. Comput. Oper. Res. 104: 90-97 (2019) - Hamid Mokhtar
, Mohan Krishnamoorthy
, Andreas T. Ernst
:
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems. Comput. Oper. Res. 104: 375-393 (2019) - Hamid Mokhtar
, A. A. N. Perwira Redi
, Mohan Krishnamoorthy, Andreas T. Ernst
:
An intermodal hub location problem for container distribution in Indonesia. Comput. Oper. Res. 104: 415-432 (2019) - Alfredo Marín, Mercedes Pelegrín-García:
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. Comput. Oper. Res. 104: 174-190 (2019) - Gerhard Rauchecker, Guido Schryen
:
Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm. Comput. Oper. Res. 104: 338-357 (2019) - Mahmood Maher Salih
, B. B. Zaidan
, A. A. Zaidan
, Mohamed Aktham Ahmed:
Survey on fuzzy TOPSIS state-of-the-art between 2007 and 2017. Comput. Oper. Res. 104: 207-227 (2019) - Hamza Ben Ticha
, Nabil Absi
, Dominique Feillet
, Alain Quilliot:
Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows. Comput. Oper. Res. 104: 113-126 (2019) - Shijin Wang, Benyan Ye:
Exact methods for order acceptance and scheduling on unrelated parallel machines. Comput. Oper. Res. 104: 159-173 (2019) - Toni Ismael Wickert, Pieter Smet
, Greet Vanden Berghe
:
The nurse rerostering problem: Strategies for reconstructing disrupted schedules. Comput. Oper. Res. 104: 319-337 (2019) - Zhenxing Xu
, Kun He, Chu-Min Li
:
An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem. Comput. Oper. Res. 104: 49-58 (2019) - Jing-Rung Yu, Wan-Jiun Paul Chiou, Wen-Yi Lee, Tsao-Yuan Chuang:
Realized performance of robust portfolios: Worst-case Omega vs. CVaR-related models. Comput. Oper. Res. 104: 239-255 (2019) - Lu Zhen
, Shuaian Wang
, Gilbert Laporte
, Yi Hu:
Integrated planning of ship deployment, service schedule and container routing. Comput. Oper. Res. 104: 304-318 (2019) - Yi-Hang Zhu
, Túlio A. M. Toffolo
, Wim Vancroonenburg
, Greet Vanden Berghe
:
Compatibility of short and long term objectives for dynamic patient admission scheduling. Comput. Oper. Res. 104: 98-112 (2019) - Hassan Zohali, Bahman Naderi, Mohammad Mohammadi
, Vahid Roshanaei
:
Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Comput. Oper. Res. 104: 127-138 (2019)
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-07-12 05:46 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