![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 27 matches
- 1998
- Agha Iqbal Ali:
Reformulation of the set partitioning problem as apure network with special order set constraints. Ann. Oper. Res. 81: 233-250 (1998) - Peter Barth, Alexander Bockmayr:
Modelling discrete optimisation problems inconstraint logic programming. Ann. Oper. Res. 81: 467-496 (1998) - Lorenzo Brunetta, Guglielmo Guastalla, Lisa Navazio:
Solving the multi-airport Ground Holding Problem. Ann. Oper. Res. 81: 271-288 (1998) - Vladimir A. Bulavsky, Vyacheslav V. Kalashnikov:
A Newton-like approach to solvingan equilibrium problem. Ann. Oper. Res. 81: 115-128 (1998) - Stefan Chanas, Dorota Kuchta:
An algorithm for solving bicriterial linear programmingproblems with parametrical coefficients in theobjective functions. Ann. Oper. Res. 81: 63-72 (1998) - Marielle Christiansen, Bjørn Nygreen:
A method for solving ship routing problemswith inventory constraints. Ann. Oper. Res. 81: 357-378 (1998) - Giorgio Consigli, M. A. H. Dempster:
Dynamic stochastic programming for asset-liability management. Ann. Oper. Res. 81: 131-162 (1998) - A. Csébfalvi:
A nonlinear path-following method for computingthe equilibrium curve of structures. Ann. Oper. Res. 81: 15-24 (1998) - Norman D. Curet:
Implementation of a steepest-edge primal - dualsimplex method for network linear programs. Ann. Oper. Res. 81: 251-270 (1998) - Mauro Dell'Amico, Francesco Maffioli, Anna Sciomachen:
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem. Ann. Oper. Res. 81: 289-306 (1998) - M. A. H. Dempster, R. T. Thompson:
Parallelization and aggregation ofnested Benders decomposition. Ann. Oper. Res. 81: 163-188 (1998) - Laureano F. Escudero, Silvano Martello, Paolo Toth:
On tightening 0-1 programs based on extensions ofpure 0-1 knapsack and subset-sum problems. Ann. Oper. Res. 81: 379-404 (1998) - Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares:
A block active set algorithm for large-scalequadratic programming with box constraints. Ann. Oper. Res. 81: 75-96 (1998) - Les R. Foulds, Horst W. Hamacher, John M. Wilson:
Integer programming approaches tofacilities layout models with forbidden areas. Ann. Oper. Res. 81: 405-418 (1998) - Alexei A. Gaivoronski, Fabio Stella:
Stochastic optimization with structured distributions: The case of Bayesian nets. Ann. Oper. Res. 81: 189-212 (1998) - Mozafar T. Hajian, Hani El Sakkout, Mark Wallace, Jonathan M. Lever, Barry Richards:
Towards a closer integration of finite domainpropagation and simplex-based algorithms. Ann. Oper. Res. 81: 421-433 (1998) - J. A. J. Hall, K. I. M. McKinnon:
ASYNPLEX, an asynchronous parallelrevised simplex algorithm. Ann. Oper. Res. 81: 27-50 (1998) - Etienne de Klerk, Cornelis Roos, Tamás Terlaky:
A nonconvex weighted potential function forpolynomial target following methods. Ann. Oper. Res. 81: 3-14 (1998) - Carlos J. Luz, Domingos M. Cardoso:
A generalization of the Hoffman - Lovász upper boundon the independence number of a regular graph. Ann. Oper. Res. 81: 307-320 (1998) - Elena A. Medova:
Chance-constrained stochastic programming forintegrated services network management. Ann. Oper. Res. 81: 213-230 (1998) - Gautam Mitra, István Maros, Anna Sciomachen:
Preface. Ann. Oper. Res. 81: 0 (1998) - Frantisek Mráz:
Calculating the exact bounds of optimal valuesin LP with interval coefficients. Ann. Oper. Res. 81: 51-62 (1998) - José Mauricio Pinto, Ignacio E. Grossmann:
Assignment and sequencing models for thescheduling of process systems. Ann. Oper. Res. 81: 433-466 (1998) - Rodrigo Lamas Vieira Pinto, B. Rustem:
Solving a mixed-integer multiobjective bond portfoliomodel involving logical conditions. Ann. Oper. Res. 81: 497-514 (1998) - Florian A. Potra, Rongqin Sheng:
A path following method for LCP withsuperlinearly convergent iteration sequence. Ann. Oper. Res. 81: 97-114 (1998) - M. Sánchez-García, M. I. Sobrón, Begoña Vitoriano:
On the set covering polytope: Facets with coefficients in {0, 1, 2, 3}. Ann. Oper. Res. 81: 343-356 (1998) - Yakov Zinder, Duncan Roper:
An iterative algorithm for scheduling unit-time taskswith precedence constraints to minimisethe maximum lateness. Ann. Oper. Res. 81: 321-343 (1998)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-25 15:52 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