Остановите войну!
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
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 44 matches
- 2021
- Can Akkan, Ayla Gülcü, Zeki Kus:
Minimum penalty perturbation heuristics for curriculum-based timetables subject to multiple disruptions. Comput. Oper. Res. 132: 105306 (2021) - Vural Aksakalli, Zeren D. Yenice, Milad Malekipirbazari, Kamyar Kargar:
Feature selection using stochastic approximation with Barzilai and Borwein non-monotone gains. Comput. Oper. Res. 132: 105334 (2021) - Mehdi Amiri-Aref, Saber Shiripour, Diego Ruiz-Hernández:
Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier. Comput. Oper. Res. 132: 105293 (2021) - Eduardo A. J. Anacleto, Cláudio N. Meneses, Ricardo N. Liang:
Fast r-flip move evaluations via closed-form formulae for Boolean quadratic programming problems with generalized upper bound constraints. Comput. Oper. Res. 132: 105297 (2021) - Ankit Bansal, Bjorn P. Berg, Yu-Li Huang:
A value function-based approach for robust surgery planning. Comput. Oper. Res. 132: 105313 (2021) - Ruggero Bellio, Sara Ceschia, Luca Di Gaspero, Andrea Schaerf:
Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Comput. Oper. Res. 132: 105300 (2021) - Abdoul Bitar, Stéphane Dauzère-Pérès, Claude Yugma:
Unrelated parallel machine scheduling with new criteria: Complexity and models. Comput. Oper. Res. 132: 105291 (2021) - Víctor Blanco, Ricardo Gázquez:
Continuous maximal covering location problems with interconnected facilities. Comput. Oper. Res. 132: 105310 (2021) - Rafael Blanquero, Emilio Carrizosa, Cristina Molero-Río, Dolores Romero Morales:
Optimal randomized classification trees. Comput. Oper. Res. 132: 105281 (2021) - Stefan Bock, Nils Boysen:
Integrated real-time control of mixed-model assembly lines and their part feeding processes. Comput. Oper. Res. 132: 105344 (2021) - Nadia Brauner, Mikhail Y. Kovalyov, Alain Quilliot, Hélène Toussaint:
No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines. Comput. Oper. Res. 132: 105315 (2021) - Maurizio Bruglieri, Roberto Cordone:
Metaheuristics for the Minimum Gap Graph Partitioning Problem. Comput. Oper. Res. 132: 105301 (2021) - K. Gulnaz Bulbul, Refail Kasimbeyli:
Augmented Lagrangian based hybrid subgradient method for solving aircraft maintenance routing problem. Comput. Oper. Res. 132: 105294 (2021) - Pedro B. Castellucci, Alysson M. Costa, Franklina Maria Bragion Toledo:
Network scheduling problem with cross-docking and loading constraints. Comput. Oper. Res. 132: 105271 (2021) - Saurabh Chandra, Manish Sarkhel, Amit Kumar Vatsa:
Capacitated facility location-allocation problem for wastewater treatment in an industrial cluster. Comput. Oper. Res. 132: 105338 (2021) - Teodor Gabriel Crainic, Franklin Djeumou Fomeni, Walter Rei:
Multi-period bin packing model and effective constructive heuristics for corridor-based logistics capacity planning. Comput. Oper. Res. 132: 105308 (2021) - Florian Delavernhe, André Rossi, Marc Sevaux:
Spatial and temporal robustness for scheduling a target tracking mission using wireless sensor networks. Comput. Oper. Res. 132: 105321 (2021) - Saliha Ferda Dogan, Özlem Karsu, Firdevs Ulus:
An exact algorithm for biobjective integer programming problems. Comput. Oper. Res. 132: 105298 (2021) - Murat Elhüseyni, Ali Tamer Ünal:
An integrated heuristic and mathematical modelling method to optimize vehicle maintenance schedule under single dead-end track parking and service level agreement. Comput. Oper. Res. 132: 105261 (2021) - Carlo Filippi, Gianfranco Guastaroba, Diana L. Huerta-Muñoz, Maria Grazia Speranza:
A kernel search heuristic for a fair facility location problem. Comput. Oper. Res. 132: 105292 (2021) - Mario Gnägi, Philipp Baumann:
A matheuristic for large-scale capacitated clustering. Comput. Oper. Res. 132: 105304 (2021) - Chao Guan, Zeqiang Zhang, Juhua Gong, Silu Liu:
Mixed integer linear programming model and an effective algorithm for the bi-objective double-floor corridor allocation problem. Comput. Oper. Res. 132: 105283 (2021) - Xiaoxia Huang, Guowei Jiang, Pankaj Gupta, Mukesh Kumar Mehlawat:
A risk index model for uncertain portfolio selection with background risk. Comput. Oper. Res. 132: 105331 (2021) - Sana Ikli, Catherine Mancel, Marcel Mongeau, Xavier Olive, Emmanuel Rachelson:
The aircraft runway scheduling problem: A survey. Comput. Oper. Res. 132: 105336 (2021) - Ahmed Kouider, Hacène Aït Haddadène:
A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling : A mixed graph coloring approach. Comput. Oper. Res. 132: 105319 (2021) - Raphael Kramer, Arthur Kramer:
An exact framework for the discrete parallel machine scheduling location problem. Comput. Oper. Res. 132: 105318 (2021) - Jongmin Lee, Gwang Kim, Ilkyeong Moon:
A mobile multi-agent sensing problem with submodular functions under a partition matroid. Comput. Oper. Res. 132: 105265 (2021) - John Martinovic, Nico Strasdat, Maximilian Selch:
Compact integer linear programming formulations for the temporal bin packing problem with fire-ups. Comput. Oper. Res. 132: 105288 (2021) - S. G. Ozden, Alice E. Smith, Kevin R. Gue:
A computational software system to design order picking warehouses. Comput. Oper. Res. 132: 105311 (2021) - Shyam S. G. Perumal, Twan Dollevoet, Dennis Huisman, Richard Martin Lusby, Jesper Larsen, Morten Riis:
Solution approaches for integrated vehicle and crew scheduling with electric buses. Comput. Oper. Res. 132: 105268 (2021)
skipping 14 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-07-20 16:29 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