default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSarmad Riazi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c13]Sarmad Riazi, Jonathan Falk, Alexander Greger, Anton Pettersson, Martin Fabian:
Formal verification of deadlock avoidance rules for AGV systems. MED 2022: 982-987- 2021
- [j6]Sarmad Riazi
, Bengt Lennartson:
Using CP/SMT Solvers for Scheduling and Routing of AGVs. IEEE Trans Autom. Sci. Eng. 18(1): 218-229 (2021) - [j5]Sabino Francesco Roselli, Fredrik Hagebring, Sarmad Riazi, Martin Fabian, Knut Åkesson:
On the Use of Equivalence Classes for Optimal and Suboptimal Bin Packing and Bin Covering. IEEE Trans Autom. Sci. Eng. 18(1): 369-381 (2021) - [j4]Sarmad Riazi, Kristofer Bengtsson, Bengt Lennartson:
Energy Optimization of Large-Scale AGV Systems. IEEE Trans Autom. Sci. Eng. 18(2): 638-649 (2021)
2010 – 2019
- 2019
- [j3]Sarmad Riazi, Oskar Wigström, Kristofer Bengtsson, Bengt Lennartson:
A Column Generation-Based Gossip Algorithm for Home Healthcare Routing and Scheduling Problems. IEEE Trans Autom. Sci. Eng. 16(1): 127-137 (2019) - [c12]Sarmad Riazi, Thomas Diding, Petter Falkman, Kristofer Bengtsson, Bengt Lennartson:
Scheduling and Routing of AGVs for Large-scale Flexible Manufacturing Systems. CASE 2019: 891-896 - [c11]Sabino Francesco Roselli, Fredrik Hagebring, Sarmad Riazi, Martin Fabian, Knut Åkesson:
On the Use of Equivalence Classes for Optimal and Sub-Optimal Bin Covering. CASE 2019: 1004-1009 - 2018
- [c10]Sarmad Riazi, Kristofer Bengtsson, Bengt Lennartson:
Parallelization of a gossip algorithm for vehicle routing problems. CASE 2018: 92-97 - 2017
- [j2]Sarmad Riazi, Oskar Wigström, Kristofer Bengtsson, Bengt Lennartson:
Energy and Peak Power Optimization of Time-Bounded Robot Trajectories. IEEE Trans Autom. Sci. Eng. 14(2): 646-657 (2017) - [c9]Oskar Wigström, Nikolce Murgovski, Sarmad Riazi, Bengt Lennartson:
Computationally efficient energy optimization of multiple robots. CASE 2017: 515-522 - [c8]Sarmad Riazi, Kristofer Bengtsson, Bengt Lennartson:
From trapezoid to polynomial: Next-generation energy-efficient robot trajectories. CASE 2017: 1191-1195 - [c7]Sarmad Riazi, Oskar Wigström, Kristofer Bengtsson, Bengt Lennartson:
Energy and peak-power optimization of time-bounded robot trajectories. CASE 2017: 1301 - [c6]Sarmad Riazi, Oskar Wigström, Kristofer Bengtsson, Bengt Lennartson:
Decomposition and distributed algorithms for home healthcare routing and scheduling problem. ETFA 2017: 1-7 - 2016
- [j1]Bengt Lennartson, Kristofer Bengtsson, Oskar Wigström, Sarmad Riazi:
Modeling and Optimization of Hybrid Systems for the Tweeting Factory. IEEE Trans Autom. Sci. Eng. 13(1): 191-205 (2016) - [c5]Sarmad Riazi, Kristofer Bengtsson, Rainer Bischoff, Andreas Aurnhammer, Oskar Wigström, Bengt Lennartson:
Energy and peak-power optimization of existing time-optimal robot trajectories. CASE 2016: 321-327 - [c4]Nina Sundström, Oskar Wigström, Sarmad Riazi, Bengt Lennartson:
On the conflict between energy, stability and robustness in production schedules. CASE 2016: 1263-1269 - 2015
- [c3]Bengt Lennartson, Oskar Wigström, Sarmad Riazi, Kristofer Bengtsson:
Modeling and Optimization of Hybrid Systems. ADHS 2015: 351-357 - [c2]Sarmad Riazi, Kristofer Bengtsson, Oskar Wigström, Emma Vidarsson, Bengt Lennartson:
Energy optimization of multi-robot systems. CASE 2015: 1345-1350 - 2013
- [c1]Sarmad Riazi, Carla Seatzu, Oskar Wigström, Bengt Lennartson:
Benders/gossip methods for heterogeneous multi-vehicle routing problems. ETFA 2013: 1-6
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-04-24 22:56 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:
