default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVahid Roshanaei
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Vahid Roshanaei
, Bahman Naderi, Opher Baron, Dmitry Krass:
An Interactive Spreadsheet Model for Teaching Classification Using Logistic Regression. INFORMS Trans. Educ. 25(1): 55-80 (2024)- 2023
- [j14]Bahman Naderi, Rubén Ruiz, Vahid Roshanaei:
Mixed-Integer Programming vs. Constraint Programming for Shop Scheduling Problems: New Results and Outlook. INFORMS J. Comput. 35(4): 817-843 (2023) - 2022
- [j13]Hassan Zohali, Bahman Naderi, Vahid Roshanaei:
Solving the Type-2 Assembly Line Balancing with Setups Using Logic-Based Benders Decomposition. INFORMS J. Comput. 34(1): 315-332 (2022) - [j12]Bahman Naderi, Vahid Roshanaei:
Critical-Path-Search Logic-Based Benders Decomposition Approaches for Flexible Job Shop Scheduling. INFORMS J. Optim. 4(1): 1-28 (2022) - 2021
- [j11]Vahid Roshanaei, Bahman Naderi:
Solving integrated operating room planning and scheduling: Logic-based Benders decomposition versus Branch-Price-and-Cut. Eur. J. Oper. Res. 293(1): 65-78 (2021) - 2020
- [j10]Bahman Naderi, Vahid Roshanaei:
Branch-Relax-and-Check: A tractable decomposition method for order acceptance and identical parallel machine scheduling. Eur. J. Oper. Res. 286(3): 811-827 (2020)
2010 – 2019
- 2019
- [j9]Hassan Zohali, Bahman Naderi, Mohammad Mohammadi, Vahid Roshanaei:
Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. Comput. Oper. Res. 104: 127-138 (2019) - [j8]Opher Baron, Oded Berman, Mohammad M. Fazel-Zarandi, Vahid Roshanaei:
Almost Robust Discrete Optimization. Eur. J. Oper. Res. 276(2): 451-465 (2019) - [j7]M. Kheirabadi, B. Naderi, A. Arshadikhamseh, Vahid Roshanaei:
A mixed-integer program and a Lagrangian-based decomposition algorithm for the supply chain network design with quantity discount and transportation modes. Expert Syst. Appl. 137: 504-516 (2019) - 2017
- [j6]Vahid Roshanaei, Curtiss Luong, Dionne M. Aleman, David R. Urbach:
Propagating logic-based Benders' decomposition approaches for distributed operating room scheduling. Eur. J. Oper. Res. 257(2): 439-455 (2017) - [j5]Vahid Roshanaei, Curtiss Luong, Dionne M. Aleman, David R. Urbach:
Collaborative Operating Room Planning and Scheduling. INFORMS J. Comput. 29(3): 558-580 (2017) - 2010
- [j4]Vahid Roshanaei, M. M. Seyyed Esfehani, Mostafa Zandieh:
Integrating non-preemptive open shops scheduling with sequence-dependent setup times using advanced metaheuristics. Expert Syst. Appl. 37(1): 259-266 (2010) - [j3]Maghsoud Amiri, Mostafa Zandieh, Behnam Vahdani, R. Soltani, Vahid Roshanaei:
An integrated eigenvector-DEA-TOPSIS methodology for portfolio risk evaluation in the FOREX spot market. Expert Syst. Appl. 37(1): 509-516 (2010)
2000 – 2009
- 2009
- [j2]B. Naderi, Mostafa Zandieh, A. Khaleghi Ghoshe Balagh, Vahid Roshanaei:
An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Syst. Appl. 36(6): 9625-9633 (2009) - [j1]Vahid Roshanaei, B. Naderi, Fariborz Jolai, M. Khalili:
A variable neighborhood search for job shop scheduling with set-up times to minimize makespan. Future Gener. Comput. Syst. 25(6): 654-661 (2009)
Coauthor Index
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.
last updated on 2024-10-23 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
