Остановите войну!
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 118 matches
- 2007
- Arianna Alfieri, Steef L. van de Velde, Gerhard J. Woeginger:
Roll cutting in the curtain industry, or: A well-solvable allocation problem. Eur. J. Oper. Res. 183(3): 1397-1404 (2007) - Ramón Alvarez-Valdés, Francisco Parreño, José Manuel Tamarit:
A tabu search algorithm for a two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 183(3): 1167-1182 (2007) - Cláudio Alves, José M. Valério de Carvalho:
Accelerating column generation for variable sized bin-packing problems. Eur. J. Oper. Res. 183(3): 1333-1352 (2007) - Mahmood Amintoosi, Hadi Sadoghi Yazdi, Mahmood Fathy, Reza Monsefi:
Using pattern matching for tiling and packing problems. Eur. J. Oper. Res. 183(3): 950-960 (2007) - Le Thi Hoai An, Le Hoai Minh, Pham Dinh Tao:
Optimization based DC programming and DCA for hierarchical clustering. Eur. J. Oper. Res. 183(3): 1067-1085 (2007) - Le Thi Hoai An, Nguyen Trong Phuc, Pham Dinh Tao:
A continuous DC programming approach to the strategic supply chain design problem from qualified partner set. Eur. J. Oper. Res. 183(3): 1001-1012 (2007) - Le Thi Hoai An, Pham Dinh Tao, Nguyen V. Thoai:
Editorial. Eur. J. Oper. Res. 183(3): 949 (2007) - Fabio Wendling Muniz de Andrade, Lyn C. Thomas:
Structural models in consumer credit. Eur. J. Oper. Res. 183(3): 1569-1581 (2007) - Galina Andreeva, Jake Ansell, Jonathan Crook:
Modelling profitability using survival combination scores. Eur. J. Oper. Res. 183(3): 1537-1549 (2007) - Claudio Arbib, Fabrizio Marinelli:
An optimization model for trim loss minimization in an automotive glass plant. Eur. J. Oper. Res. 183(3): 1421-1432 (2007) - Vinícius Amaral Armentano, Moacir Felizardo de França Filho:
Minimizing total tardiness in parallel machine scheduling with setup times: An adaptive memory-based GRASP approach. Eur. J. Oper. Res. 183(1): 100-114 (2007) - Jalal Ashayeri, Willem J. Selen:
A planning and scheduling model for onsertion in printed circuit board assembly. Eur. J. Oper. Res. 183(2): 909-925 (2007) - Roberto Baldacci, Marco A. Boschetti:
A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem. Eur. J. Oper. Res. 183(3): 1136-1149 (2007) - John Banasik, Jonathan Crook:
Reject inference, augmentation, and sample selection. Eur. J. Oper. Res. 183(3): 1582-1594 (2007) - Shaul K. Bar-Lev, Mahmut Parlar, David Perry, Wolfgang Stadje, Frank A. Van der Duyn Schouten:
Applications of bulk queues to group testing models with incomplete identification. Eur. J. Oper. Res. 183(1): 226-237 (2007) - Opher Baron, Oded Berman, Dmitry Krass, Qian Wang:
The equitable location problem on the plane. Eur. J. Oper. Res. 183(2): 578-590 (2007) - Adil Baykasoglu, Lale Özbakir:
MEPAR-miner: Multi-expression programming for classification rule mining. Eur. J. Oper. Res. 183(2): 767-784 (2007) - Massoud Bazargan:
A linear programming approach for aircraft boarding strategy. Eur. J. Oper. Res. 183(1): 394-411 (2007) - Michel Bierlaire, Frank Crittin, M. Thémans:
A multi-iterate method to solve systems of nonlinear equations. Eur. J. Oper. Res. 183(1): 20-41 (2007) - Amelia Bilbao-Terol, Mar Arenas Parra, Maria Victoria Rodríguez, J. Antomil:
On constructing expert Betas for single-index model. Eur. J. Oper. Res. 183(2): 827-847 (2007) - Kevin J. Binkley, Masafumi Hagiwara:
Applying self-adaptive evolutionary algorithms to two-dimensional packing problems using a four corners' heuristic. Eur. J. Oper. Res. 183(3): 1230-1248 (2007) - Marie-Claude Bolduc, Jacques Renaud, Fayez F. Boctor:
A heuristic for the routing and carrier selection problem. Eur. J. Oper. Res. 183(2): 926-932 (2007) - Andreas Bortfeldt, Daniel Mack:
A heuristic for the three-dimensional strip packing problem. Eur. J. Oper. Res. 183(3): 1267-1279 (2007) - Nils Boysen, Malte Fliedner, Armin Scholl:
A classification of assembly line balancing problems. Eur. J. Oper. Res. 183(2): 674-693 (2007) - Joachim Breit:
Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint. Eur. J. Oper. Res. 183(2): 516-524 (2007) - Tom M. Cavalier, Whitney A. Conner, Enrique del Castillo, Stuart I. Brown:
A heuristic algorithm for minimax sensor location in the plane. Eur. J. Oper. Res. 183(1): 42-55 (2007) - Lu-Chuan Ceng, Jen-Chih Yao:
Approximate proximal methods in vector optimization. Eur. J. Oper. Res. 183(1): 1-19 (2007) - Satyaveer Singh Chauhan, Valery S. Gordon, Jean-Marie Proth:
Scheduling in supply chain environment. Eur. J. Oper. Res. 183(3): 961-970 (2007) - Shih-Pin Chen:
Analysis of critical paths in a project network with fuzzy activity times. Eur. J. Oper. Res. 183(1): 442-459 (2007) - Liang-Hsuan Chen, Fu-Sen Kang:
Integrated vendor-buyer cooperative inventory models with variant permissible delay in payments. Eur. J. Oper. Res. 183(2): 658-673 (2007)
skipping 88 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-04-25 11:05 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