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 29 matches
- 2009
- Jesús Sáez Aguado:
Fixed Charge Transportation Problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems. Ann. Oper. Res. 172(1): 45-69 (2009) - M. Josune Albizuri:
The multichoice coalition value. Ann. Oper. Res. 172(1): 363-374 (2009) - Ramesh Arumugam, Maria E. Mayorga, Kevin M. Taaffe:
Inventory based allocation policies for flexible servers in serial systems. Ann. Oper. Res. 172(1): 1-23 (2009) - Önder Baris Asik, Ender Özcan:
Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Ann. Oper. Res. 172(1): 405-427 (2009) - Sameh S. Askar, Ashutosh Tiwari:
First-order optimality conditions and duality results for multi-objective optimisation problems. Ann. Oper. Res. 172(1): 277-289 (2009) - Rob J. I. Basten, J. M. J. Schutten, M. C. van der Heijden:
An efficient model formulation for level of repair analysis. Ann. Oper. Res. 172(1): 119-142 (2009) - Illana Bendavid, Boaz Golany:
Setting gates for activities in the stochastic project scheduling problem through the cross entropy methodology. Ann. Oper. Res. 172(1): 259-276 (2009) - Kimmo Berg, Harri Ehtamo:
Learning in nonlinear pricing with unknown utility functions. Ann. Oper. Res. 172(1): 375-392 (2009) - Sergio Consoli, Ken Darby-Dowman, Nenad Mladenovic, José A. Moreno-Pérez:
Variable neighbourhood search for the minimum labelling Steiner tree problem. Ann. Oper. Res. 172(1): 71-96 (2009) - Elisabeth Gassner:
A game-theoretic approach for downgrading the 1-median in the plane with Manhattan metric. Ann. Oper. Res. 172(1): 393-404 (2009) - Genaro J. Gutierrez, Panagiotis Kouvelis, Lawrence V. Snyder:
Errata for "A robustness approach to international sourcing" by G.J. Gutierrez and P. Kouvelis, Annals of Operations Research 59 (1995) 165-193. Ann. Oper. Res. 172(1): 463 (2009) - Donatien Hainaut:
Dynamic asset allocation under VaR constraint with stochastic interest rates. Ann. Oper. Res. 172(1): 97-117 (2009) - Adam Kasperski, Pawel Zielinski:
A randomized algorithm for the min-max selecting items problem with uncertain weights. Ann. Oper. Res. 172(1): 221-230 (2009) - Thiemo Krink, Stefan Mittnik, Sandra Paterlini:
Differential evolution and combinatorial search for constrained index-tracking. Ann. Oper. Res. 172(1): 153-176 (2009) - Jenn-Rong Lin, Hsien-Chung Lei:
Distribution systems design with two-level routing considerations. Ann. Oper. Res. 172(1): 329-347 (2009) - Maria E. Mayorga, Kevin M. Taaffe, Ramesh Arumugam:
Allocating flexible servers in serial systems with switching costs. Ann. Oper. Res. 172(1): 231-242 (2009) - Masashi Miyagawa:
Optimal hierarchical system of a grid road network. Ann. Oper. Res. 172(1): 349-361 (2009) - Tomás Müller:
ITC2007 solver description: a hybrid approach. Ann. Oper. Res. 172(1): 429-446 (2009) - Yury Nikulin:
Stability and accuracy functions in a coalition game with bans, linear payoffs and antagonistic strategies. Ann. Oper. Res. 172(1): 25-35 (2009) - Reza Ramezanian, A. Karamouzian:
Comments on "Scheduling jobs on a k-stage flexible flow-shop" [Annals of Operations Research (2008) 164: 29-40]. Ann. Oper. Res. 172(1): 459-462 (2009) - Reza Farzipoor Saen:
A decision model for ranking suppliers in the presence of cardinal and ordinal data, weight restrictions, and nondiscretionary factors. Ann. Oper. Res. 172(1): 177-192 (2009) - Armin Scholl, Nils Boysen, Malte Fliedner:
Optimally solving the alternative subgraphs assembly line balancing problem. Ann. Oper. Res. 172(1): 243-258 (2009) - Pritibhushan Sinha:
Assignment problems with changeover cost. Ann. Oper. Res. 172(1): 447-457 (2009) - Sebastian Sitarz:
Pareto optimal allocations and dynamic programming. Ann. Oper. Res. 172(1): 203-219 (2009) - Majid Soleimani-Damaneh, Masoud Zarepisheh:
Linear transformations to decrease computational requirements of solving some known linear programming models. Ann. Oper. Res. 172(1): 37-43 (2009) - Özgecan S. Ulusçu, Tayfur Altiok:
Waiting time approximation in single-class queueing systems with multiple types of interruptions: modeling congestion at waterways entrances. Ann. Oper. Res. 172(1): 291-313 (2009) - Wei Xiong, Tayfur Altiok:
An approximation for multi-server queues with deterministic reneging times. Ann. Oper. Res. 172(1): 143-151 (2009) - Dar-Li Yang, Wen-Hung Kuo:
Single-machine scheduling with both deterioration and learning effects. Ann. Oper. Res. 172(1): 315-327 (2009) - Chunyang Zhou, Chongfeng Wu, Yun Feng:
An exact algorithm for the type-constrained and variable sized bin packing problem. Ann. Oper. Res. 172(1): 193-202 (2009)
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-11-30 03:20 CET 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