Остановите войну!
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 26 matches
- 2008
- Lihua Bai, Huayue Zhang:
Dynamic mean-variance problem with constrained risk control for the insurers. Math. Methods Oper. Res. 68(1): 181-205 (2008) - Erhan Bayraktar, H. Vincent Poor:
Optimal time to change premiums. Math. Methods Oper. Res. 68(1): 125-158 (2008) - Odellia Boni, Aharon Ben-Tal:
Adjustable robust counterpart of conic quadratic problems. Math. Methods Oper. Res. 68(2): 211-233 (2008) - Stephan Bütikofer:
Globalizing a nonsmooth Newton method via nonmonotone path search. Math. Methods Oper. Res. 68(2): 235-256 (2008) - Robert Chares, François Glineur:
An interior-point method for the single-facility location problem with mixed norms using a conic formulation. Math. Methods Oper. Res. 68(3): 383-405 (2008) - David G. Conradie, Leilani E. Morison, Johan W. Joubert:
Scheduling at coal handling facilities using Simulated Annealing. Math. Methods Oper. Res. 68(2): 277-293 (2008) - Sergio Delgado-Quintero, Juan José Salazar González:
A new approach for data editing and imputation. Math. Methods Oper. Res. 68(3): 407-428 (2008) - Andreas Drexl, Martin Mundschenk:
Long-term staffing based on qualification profiles. Math. Methods Oper. Res. 68(1): 21-47 (2008) - Ken R. Duffy, David Malone:
Logarithmic asymptotics for a single-server processing distinguishable sources. Math. Methods Oper. Res. 68(3): 509-537 (2008) - Mirjam Dür, Petra Huhn, Kathrin Klamroth, Christiane Tammer:
Special issue dedicated to the EURO Summer Institute ESI XXIV: Optimization challenges in engineering - methods, software, and applications. Math. Methods Oper. Res. 68(2): 207-210 (2008) - Christian-Oliver Ewald, Zhaojun Yang:
Utility based pricing and exercising of real options under geometric mean reversion and risk aversion toward idiosyncratic risk. Math. Methods Oper. Res. 68(1): 97-123 (2008) - Begoña Fernández, Daniel Hernández-Hernández, Ana Meda, Patricia Saavedra:
An optimal investment strategy with maximal risk aversion and its ruin probability. Math. Methods Oper. Res. 68(1): 159-179 (2008) - Armin Fügenschuh, Marzena Fügenschuh:
Integer linear programming models for topology optimization in sheet metal design. Math. Methods Oper. Res. 68(2): 313-331 (2008) - Evgueni Gordienko, Enrique Lemus-Rodríguez, Raúl Montes-de-Oca:
Discounted cost optimality problem: stability with respect to weak metrics. Math. Methods Oper. Res. 68(1): 77-96 (2008) - Oualid Jouini, Yves Dallery:
Moments of first passage times in general birth-death processes. Math. Methods Oper. Res. 68(1): 49-76 (2008) - Moshe Kress, Kyle Y. Lin, Roberto Szechtman:
Optimal discrete search with imperfect specificity. Math. Methods Oper. Res. 68(3): 539-549 (2008) - Sven Oliver Krumke, Sleman Saliba, Tjark Vredeveld, Stephan Westphal:
Approximation algorithms for a vehicle routing problem. Math. Methods Oper. Res. 68(2): 333-359 (2008) - Valeria Leggieri, Paolo Nobili, Chefi Triki:
Minimum power multicasting problem in wireless networks. Math. Methods Oper. Res. 68(2): 295-311 (2008) - Wieslawa T. Obuchowska:
On boundedness of (quasi-)convex integer optimization problems. Math. Methods Oper. Res. 68(3): 445-467 (2008) - Guido Perboli, Ferdinando Pezzella, Roberto Tadei:
EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem. Math. Methods Oper. Res. 68(2): 361-382 (2008) - Justo Puerto, Anita Schöbel, Silvia Schwarze:
The path player game - A network game from the point of view of the network providers. Math. Methods Oper. Res. 68(1): 1-20 (2008) - Katrin Schmallowsky:
On the regularity of second order cone programs and an application to solving large scale problems. Math. Methods Oper. Res. 68(3): 551-564 (2008) - Lizhen Shao, Matthias Ehrgott:
Approximately solving multiobjective linear programmes in objective space and an application in radiotherapy treatment planning. Math. Methods Oper. Res. 68(2): 257-276 (2008) - Lizhen Shao, Matthias Ehrgott:
Approximating the nondominated set of an MOLP by approximately solving its dual problem. Math. Methods Oper. Res. 68(3): 469-492 (2008) - Constantin Zalinescu:
Hahn-Banach extension theorems for multifunctions revisited. Math. Methods Oper. Res. 68(3): 493-508 (2008) - Antanas Zilinskas, Julius Zilinskas:
A hybrid method for multidimensional scaling using city-block distances. Math. Methods Oper. Res. 68(3): 429-443 (2008)
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-05 21:45 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