![](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 41 matches
- 1999
- Dimitris Alevras:
Small Min-Cut Polyhedra. Math. Oper. Res. 24(1): 35-49 (1999) - Steve Alpern, Anatole Beck:
Asymmetric Rendezvous on the Line Is a Double Linear Search Problem. Math. Oper. Res. 24(3): 604-618 (1999) - Kurt M. Anstreicher:
Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier. Math. Oper. Res. 24(1): 193-203 (1999) - Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye:
Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming. Math. Oper. Res. 24(1): 176-192 (1999) - Alfred Auslender, Marc Teboulle, Sami Ben-Tiba:
Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels. Math. Oper. Res. 24(3): 645-668 (1999) - Egon Balas, Matteo Fischetti:
Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem. Math. Oper. Res. 24(2): 273-292 (1999) - Wojciech Banaszczyk
, Alexander E. Litvak, Alain Pajor, Stanislaw J. Szarek
:
The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces. Math. Oper. Res. 24(3): 728-750 (1999) - Stephen C. Billups
, Michael C. Ferris
:
Solutions to Affine Generalized Equations Using Proximal Mappings. Math. Oper. Res. 24(1): 219-236 (1999) - Mark Brown:
Interlacing Eigenvalues in Time Reversible Markov Chains. Math. Oper. Res. 24(4): 847-864 (1999) - John L. Bruno, Edward G. Coffman Jr., Jeffrey C. Lagarias, Tom J. Richardson, Peter W. Shor:
Processor Shadowing: Maximizing Expected Throughput in Fault-Tolerant Systems. Math. Oper. Res. 24(2): 362-382 (1999) - Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger:
Erratum: The Travelling Salesman and the PQ-Tree. Math. Oper. Res. 24(1): 262-272 (1999) - Jean-Michel Coulomb:
Generalized "Big-Match". Math. Oper. Res. 24(4): 795-816 (1999) - Xiaotie Deng
, Toshihide Ibaraki, Hiroshi Nagamochi:
Algorithmic Aspects of the Core of Combinatorial Optimization Games. Math. Oper. Res. 24(3): 751-766 (1999) - Michel Denuit, Claude Lefèvre, Sergey Utev:
Stochastic Orderings of Convex/Concave-Type on an Arbitrary Grid. Math. Oper. Res. 24(4): 835-846 (1999) - Andreas Fischer
:
Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers. Math. Oper. Res. 24(3): 699-727 (1999) - Lisa Fleischer, Éva Tardos:
Separating Maximally Violated Comb Inequalities in Planar Graphs. Math. Oper. Res. 24(1): 130-148 (1999) - János Flesch, Andrés Perea y Monsuwé:
Repeated Games with Endogenous Choice of Information Mechanisms. Math. Oper. Res. 24(4): 785-794 (1999) - Roland W. Freund, Florian Jarre, Shinji Mizuno:
Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs. Math. Oper. Res. 24(1): 50-71 (1999) - Celia A. Glass, Jatinder N. D. Gupta
, Chris N. Potts:
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Math. Oper. Res. 24(4): 911-924 (1999) - M. Seetharama Gowda, Roman Sznajder:
Weak Univalence and Connectedness of Inverse Images of Continuous Functions. Math. Oper. Res. 24(1): 255-261 (1999) - Mark Hartmann, Cristina Arguelles:
Transience Bounds for Long Walks. Math. Oper. Res. 24(2): 414-439 (1999) - J. A. Hoogeveen, Tsuyoshi Kawaguchi:
Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases. Math. Oper. Res. 24(4): 887-910 (1999) - Xiaotao Huang, Richard F. Serfozo:
Spatial Queueing Processes. Math. Oper. Res. 24(4): 865-886 (1999) - David R. Karger
:
Random Sampling in Cut, Flow, and Network Design Problems. Math. Oper. Res. 24(2): 383-413 (1999) - Krzysztof C. Kiwiel, Torbjörn Larsson
, Per Olov Lindberg:
The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization. Math. Oper. Res. 24(1): 237-254 (1999) - Ehud Lehrer, Leeat Yariv:
Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors. Math. Oper. Res. 24(1): 204-218 (1999) - Adrian S. Lewis:
Ill-Conditioned Convex Processes and Conic Linear Systems. Math. Oper. Res. 24(4): 829-834 (1999) - Ludolf E. Meester, J. George Shanthikumar:
Stochastic Convexity on General Space. Math. Oper. Res. 24(2): 472-494 (1999) - Bernard De Meyer, Dinah Rosenberg:
"Cav u" and the Dual Game. Math. Oper. Res. 24(3): 619-626 (1999) - Masakazu Muramatsu, Robert J. Vanderbei:
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming. Math. Oper. Res. 24(1): 149-175 (1999)
skipping 11 more matches
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-02 20:31 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