Остановите войну!
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 321 matches
- 2012
- Philipp Aigner, Georg Beyschlag, Tim Friederich, Markus Kalepky, Rudi Zagst:
Modeling and managing portfolios including listed private equity. Comput. Oper. Res. 39(4): 753-764 (2012) - Deniz Aksen, Necati Aras:
A bilevel fixed charge location model for facilities under imminent attack. Comput. Oper. Res. 39(7): 1364-1381 (2012) - M. Hakan Akyüz, Temel Öncan, I. Kuban Altinel:
Efficient approximate solution methods for the multi-commodity capacitated multi-facility Weber problem. Comput. Oper. Res. 39(2): 225-237 (2012) - Douglas José Alem, Reinaldo Morabito:
Production planning in furniture settings via robust optimization. Comput. Oper. Res. 39(2): 139-150 (2012) - Gianluca Aloi, Roberto Musmanno, Pasquale Pace, Ornella Pisacane:
A wise cost-effective supplying bandwidth policy for multilayer wireless cognitive networks. Comput. Oper. Res. 39(11): 2836-2847 (2012) - Antonio Alonso-Ayuso, Laureano F. Escudero, Francisco Javier Martín-Campo:
A mixed 0-1 nonlinear optimization model and algorithmic approach for the collision avoidance in ATM: Velocity changes through a time horizon. Comput. Oper. Res. 39(12): 3136-3146 (2012) - Cláudio Alves, Pedro Brás, José M. Valério de Carvalho, Telmo Pinto:
New constructive algorithms for leather nesting in the automotive industry. Comput. Oper. Res. 39(7): 1487-1505 (2012) - André Renato Sales Amaral:
The corridor allocation problem. Comput. Oper. Res. 39(12): 3325-3330 (2012) - Davide Anghinolfi, Giorgio Cannata, Fulvio Mastrogiovanni, Cristiano Nattero, Massimo Paolucci:
Heuristic approaches for the optimal wiring in large scale robotic skin design. Comput. Oper. Res. 39(11): 2715-2724 (2012) - Yohei Arahori, Takashi Imamichi, Hiroshi Nagamochi:
An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39(12): 2991-3011 (2012) - Mostafa K. Ardakani, Lu Sun:
Decremental algorithm for adaptive routing incorporating traveler information. Comput. Oper. Res. 39(12): 3012-3020 (2012) - Pasquale Avella, Maurizio Boccia, Saverio Salerno, Igor Vasilyev:
An aggregation heuristic for large scale p-median problem. Comput. Oper. Res. 39(7): 1625-1632 (2012) - Tal Avinadav, David Sarne:
Sequencing counts: A combined approach for sequencing and selecting costly unreliable off-line inspections. Comput. Oper. Res. 39(11): 2488-2499 (2012) - Jørgen Bang-Jensen, Rune Larsen:
Efficient algorithms for real-life instances of the variable size bin packing problem. Comput. Oper. Res. 39(11): 2848-2857 (2012) - Olga Battaïa, Alexandre Dolgui:
Reduction approaches for a generalized line balancing problem. Comput. Oper. Res. 39(10): 2337-2345 (2012) - Hendrik Baumann, Werner Sandmann:
Steady state analysis of level dependent quasi-birth-and-death processes with catastrophes. Comput. Oper. Res. 39(2): 413-423 (2012) - Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Efficient determination of the k most vital edges for the minimum spanning tree problem. Comput. Oper. Res. 39(11): 2888-2898 (2012) - Prince Bedell, J. MacGregor Smith:
Topological arrangements of M/G/c/K, M/G/c/c queues in transportation and material handling systems. Comput. Oper. Res. 39(11): 2800-2819 (2012) - Behnam Behdani, YoungSang Yun, J. Cole Smith, Ye Xia:
Decomposition algorithms for maximizing the lifetime of wireless sensor networks with mobile sinks. Comput. Oper. Res. 39(5): 1054-1061 (2012) - Mohamed Bendraouche, Mourad Boudhar:
Scheduling jobs on identical machines with agreement graph. Comput. Oper. Res. 39(2): 382-390 (2012) - Jean Berger, Abdeslem Boukhtouta, Abdelhamid Benmoussa, Ossama Kettani:
A new mixed-integer linear programming model for rescue path planning in uncertain adversarial environment. Comput. Oper. Res. 39(12): 3420-3430 (2012) - Pavel A. Borisovsky, Alexandre Dolgui, Sergey Kovalev:
Algorithms and implementation of a set partitioning approach for modular machining line design. Comput. Oper. Res. 39(12): 3147-3155 (2012) - Claudio T. Bornstein, Nelson Maculan, Marta Pascoal, Leizer de Lima Pinto:
Multiobjective combinatorial optimization problems with a cost and several bottleneck objective functions: An algorithm with reoptimization. Comput. Oper. Res. 39(9): 1969-1976 (2012) - Andreas Bortfeldt:
A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints. Comput. Oper. Res. 39(9): 2248-2257 (2012) - Marie-Laure Bougnol, José H. Dulá, Paul Rouse:
Interior point methods in DEA to determine non-zero multiplier weights. Comput. Oper. Res. 39(3): 698-708 (2012) - Ilhem Boussaïd, Amitava Chatterjee, Patrick Siarry, Mohamed Ahmed-Nacer:
Biogeography-based optimization for constrained optimization problems. Comput. Oper. Res. 39(12): 3293-3304 (2012) - Vincent Boyer, Didier El Baz, Moussa Elkihel:
Solving knapsack problems on GPU. Comput. Oper. Res. 39(1): 42-47 (2012) - Wojciech Bozejko:
On single-walk parallelization of the job shop problem solving algorithms. Comput. Oper. Res. 39(9): 2258-2264 (2012) - Dirk Briskorn, Andrei Horbach:
A Lagrangian approach for minimum cost single round robin tournaments. Comput. Oper. Res. 39(3): 718-727 (2012) - Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard:
A Tabu search algorithm for the network pricing problem. Comput. Oper. Res. 39(11): 2603-2611 (2012)
skipping 291 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-05-25 08:55 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