Остановите войну!
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 29 matches
- 2020
- Amir Ahmadi-Javid, Nasrin Ramshe:
Correction to: Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm. 4OR 18(3): 385 (2020) - Maria Teresa Alonso, Ramón Alvarez-Valdés, Francisco Parreño:
A GRASP algorithm for multi container loading problems with practical constraints. 4OR 18(1): 49-72 (2020) - Katyanne Farias de Araújo:
Inventory routing problems on two-echelon systems: exact and heuristic methods for the tactical and operational problems. 4OR 18(3): 383-384 (2020) - Dan Bienstock, Mauro Escobar, Claudio Gentile, Leo Liberti:
Mathematical programming formulations for the alternating current optimal power flow problem. 4OR 18(3): 249-292 (2020) - Sanaz Bojari, M. R. Eslahchi:
Global convergence of a family of modified BFGS methods under a modified weak-Wolfe-Powell line search for nonconvex functions. 4OR 18(2): 219-244 (2020) - Arno De Caigny:
Innovation in customer scoring for the financial services industry. 4OR 18(3): 381-382 (2020) - Emilio Carrizosa, Alba V. Olivares-Nadal, Pepa Ramírez-Cobo:
Embedding the production policy in location-allocation decisions. 4OR 18(3): 357-380 (2020) - Hadi Charkhgard, Mahdi Takalloo, Zulqarnain Haider:
Bi-objective autonomous vehicle repositioning problem with travel time uncertainty. 4OR 18(4): 477-505 (2020) - Rubing Chen, Jinjiang Yuan:
Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices. 4OR 18(2): 177-196 (2020) - Jéssica Gabriela de Almeida Cunha, Vinícius Loti de Lima, Thiago Alves de Queiroz:
Grids for cutting and packing problems: a study in the 2D knapsack problem. 4OR 18(3): 293-339 (2020) - Davide Duma:
Online optimization methods applied to the management of health services. 4OR 18(1): 125-126 (2020) - Martijn van Ee, René Sitters:
The Chinese deliveryman problem. 4OR 18(3): 341-356 (2020) - Edoardo Fadda:
Integrating sensors data in optimization methods for sustainable urban logistic. 4OR 18(2): 245-246 (2020) - Manlio Gaudioso, Giovanni Giallombardo, Giovanna Miglionico:
Essentials of numerical nonsmooth optimization. 4OR 18(1): 1-47 (2020) - Fred W. Glover, Gary A. Kochenberger, Moses Ma, Yu Du:
Quantum Bridge Analytics II: QUBO-Plus, network optimization and combinatorial chaining for asset exchange. 4OR 18(4): 387-417 (2020) - Juan Carlos Gonçalves-Dosantos, Ignacio García-Jurado, Julián Costa-Bouzas:
Sharing delay costs in stochastic scheduling problems with delays. 4OR 18(4): 457-476 (2020) - Hilde Heggen:
Optimising load planning and container routing in intermodal rail transport. 4OR 18(1): 127-128 (2020) - Arthur Kramer:
Exact and heuristic algorithms for scheduling problems. 4OR 18(1): 123-124 (2020) - N. Mahdavi-Amiri, M. Shaeiri:
A conjugate gradient sampling method for nonsmooth optimization. 4OR 18(1): 73-90 (2020) - Andrea Mor, Maria Grazia Speranza:
Vehicle routing problems over time: a survey. 4OR 18(2): 129-149 (2020) - Gur Mosheiov, Assaf Sarig, Vitaly A. Strusevich:
Minmax scheduling and due-window assignment with position-dependent processing times and job rejection. 4OR 18(4): 439-456 (2020) - Mariangela Rosano:
Mixing quantitative and qualitative methods for sustainable transportation in smart cities. 4OR 18(2): 247-248 (2020) - Lars Schewe, Martin Schmidt, Johannes Thürauf:
Structural properties of feasible bookings in the European entry-exit gas market system. 4OR 18(2): 197-218 (2020) - Dhananjay R. Thiruvady, Rhyd Lewis, Kerri Morgan:
Tackling the maximum happy vertices problem in large networks. 4OR 18(4): 507-527 (2020) - Hendrik Vermuyten:
Design of integrated scheduling and simulation models to optimise people flows and maximise safety. 4OR 18(4): 529-530 (2020) - Acknowledgement to referees. 4OR 18(4): 531-532 (2020)
- Guilan Yan, Yi He:
Coordinating pricing and advertising in a two-period fashion supply chain. 4OR 18(4): 419-438 (2020) - Bo Yan, Jiwen Wu, Zijie Jin, Shiyou He:
Decision-making of fresh agricultural product supply chain considering the manufacturer's fairness concerns. 4OR 18(1): 91-122 (2020) - Xide Zhu, Peijun Guo:
Bilevel programming approaches to production planning for multiple products with short life cycles. 4OR 18(2): 151-175 (2020)
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-07-28 21:33 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