Остановите войну!
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 33 matches
- 1991
- Kurt M. Anstreicher:
A combined phase I-phase II scaled potential algorithm for linear programming. Math. Program. 52: 429-439 (1991) - Franz Aurenhammer:
Using Gale transforms in computational geometry. Math. Program. 52: 179-190 (1991) - Jean-Pierre Crouzeix, Jacques A. Ferland:
Algorithms for generalized fractional programming. Math. Program. 52: 191-207 (1991) - Robert M. Freund:
A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start". Math. Program. 52: 441-466 (1991) - Clóvis C. Gonzaga:
Interior point algorithms for linear programming with inequality constraints. Math. Program. 52: 209-225 (1991) - Clóvis C. Gonzaga:
On lower bound updates in primal potential reduction methods for linear programming. Math. Program. 52: 415-428 (1991) - Pierre Hansen, Marcus Poggi de Aragão, Celso C. Ribeiro:
Hyperbolic 0-1 programming and query optimization in information retrieval. Math. Program. 52: 255-263 (1991) - Pierre Hansen, Brigitte Jaumard, Shi-Hui Lu:
An analytical approach to global optimization. Math. Program. 52: 227-254 (1991) - Claus Thorp Hansen, Kaj Madsen, Hans Bruun Nielsen:
Optimization of pipe networks. Math. Program. 52: 45-58 (1991) - Dick den Hertog, Cees Roos:
A survey of search directions in interior point methods for linear programming. Math. Program. 52: 481-509 (1991) - Masao Iri:
Integrability of vector and multivector fields associated with interior point methods for linear programming. Math. Program. 52: 511-525 (1991) - Alfredo N. Iusem, Alvaro R. De Pierro:
On the convergence of Han's method for convex programming with quadratic objective. Math. Program. 52: 265-284 (1991) - Narendra Karmarkar, K. G. Ramakrishnan:
Computational results of an interior point algorithm for large scale linear programming. Math. Program. 52: 555-586 (1991) - Narendra Karmarkar, Mauricio G. C. Resende, K. G. Ramakrishnan:
An interior point algorithm to solve computationally difficult set covering problems. Math. Program. 52: 597-618 (1991) - Takeo Kawashiro, Fumihiro Yamasawa, Yasumasa Okada, Hirosuke Kobayashi, Kunio Tanabe:
Uneven distribution of ventilation-perfusion ratios in lungs estimated by a modified Newton method. Math. Program. 52: 1-9 (1991) - Krzysztof C. Kiwiel:
Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization. Math. Program. 52: 285-302 (1991) - Takeshi Koshizuka, Osamu Kurita:
Approximate formulas of average distances associated with regions and their applications to location problems. Math. Program. 52: 99-123 (1991) - Vera V. Kovacevic-Vujcic:
Improving the rate of convergence of interior point methods for linear programming. Math. Program. 52: 467-479 (1991) - Garth P. McCormick, Ariela Sofer:
Optimization with unary functions. Math. Program. 52: 167-178 (1991) - Philippe Michelon, Nelson Maculan:
Lagrangean decomposition for integer nonlinear programming with linear constraints. Math. Program. 52: 303-313 (1991) - Shinji Mizuno, Michael J. Todd:
An O(n3L) adaptive path following algorithm for a linear complementarity problem. Math. Program. 52: 587-595 (1991) - Bjørn Nygreen:
Branch and bound with estimation based on pseudo-shadow-prices. Math. Program. 52: 59-69 (1991) - Manfred Padberg, Ting-Yi Sung:
An analytical comparison of different formulations of the travelling salesman problem. Math. Program. 52: 315-357 (1991) - Carlos Eduardo Pedreira, V. B. Vila:
Optimal schedule for cancer chemotherapy. Math. Program. 52: 11-17 (1991) - Mario V. F. Pereira, Leontina M. V. Pinto:
Multi-stage stochastic optimization applied to energy planning. Math. Program. 52: 359-375 (1991) - Jati K. Sengupta:
The influence curve approach in data envelopment analysis. Math. Program. 52: 147-166 (1991) - Fumiko Seo:
Utilization of mathematical programming for public systems: An application to effective formation of integrated regional information networks. Math. Program. 52: 71-98 (1991) - György Sonnevend, Josef Stoer, Gongyun Zhao:
On the complexity of following the central path of linear programs by linear extrapolation II. Math. Program. 52: 527-553 (1991) - Tsutomu Suzuki, Yasushi Asami, Atsuyuki Okabe:
Sequential location-allocation of public facilities in one- and two-dimensional space: Comparison of several policies. Math. Program. 52: 125-146 (1991) - M. Tamura, Y. Kobayashi:
Application of sequential quadratic programming software program to an actual problem. Math. Program. 52: 19-27 (1991)
skipping 3 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-27 08:43 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