default search action
Moshe Kaspi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j15]Moshe Kaspi
, Moshe Zofi, Ron Teller:
Maximizing the profit per unit time for the travelling salesman problem. Comput. Ind. Eng. 135: 702-710 (2019) - [j14]Ron Teller, Moshe Zofi, Moshe Kaspi
Minimizing the average searching time for an object within a graph. Comput. Optim. Appl. 74(2): 517-545 (2019) - 2018
- [j13]Hadas Elalouf, Moshe Kaspi
Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: Simulation and response surface methodology. Comput. Oper. Res. 89: 230-240 (2018) - 2017
- [j12]Moshe Zofi, Ron Teller, Moshe Kaspi
Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times. J. Oper. Res. Soc. 68(10): 1177-1182 (2017) - 2016
- [j11]Danny Hermelin
Parameterized complexity of critical node cuts. Theor. Comput. Sci. 651: 62-75 (2016) - 2015
- [j10]Dvir Shabtay
Erratum to: A survey on offline scheduling with rejection. J. Sched. 18(3): 329 (2015) - [c3]Danny Hermelin
Parameterized Complexity of Critical Node Cuts. IPEC 2015: 343-354 - [i1]Danny Hermelin, Moshe Kaspi, Christian Komusiewicz, Barak Navon:
Parameterized Complexity of Critical Node Cuts. CoRR abs/1503.06321 (2015) - 2013
- [j9]Dvir Shabtay
A survey on offline scheduling with rejection. J. Sched. 16(1): 3-28 (2013) - 2011
- [j8]Liron Yedidsion, Dvir Shabtay
Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling. Discret. Appl. Math. 159(12): 1264-1278 (2011)
2000 – 2009
- 2007
- [j7]Yael Perlman
Centralized decision of internal transfer-prices with congestion externalities for two modes of repair with limited repair capacity. J. Oper. Res. Soc. 58(9): 1178-1184 (2007) - [j6]Liron Yedidsion, Dvir Shabtay
A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. J. Sched. 10(6): 341-352 (2007) - [c2]Helman Stern, Moshe Zofi, Moshe Kaspi:
Multi Observer 3D Visual Area Coverage Scheduling Using Decomposition Methodologies. IC-AI 2007: 114-120 - 2006
- [j5]Moshe Kaspi
A bicriterion approach to time/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Comput. Oper. Res. 33(10): 3015-3033 (2006) - [j4]Dvir Shabtay
Parallel machine scheduling with a convex resource consumption function. Eur. J. Oper. Res. 173(1): 92-107 (2006) - 2005
- [c1]Helman Stern, Yoash Chassidim, Moshe Zofi, Moshe Kaspi:
Multi Agent Visual Area Coverage Strategies using an Adaptive Queen Genetic Algorithm. Artificial Intelligence and Applications 2005: 118-124 - 2004
- [j3]Moshe Kaspi
Convex resource allocation for minimizing the makespan in a single machine with job release dates. Comput. Oper. Res. 31(9): 1481-1489 (2004) - [j2]Dvir Shabtay
Minimizing the total weighted flow time in a single machine with controllable processing times. Comput. Oper. Res. 31(13): 2279-2289 (2004) - 2001
- [j1]Yael Perlman
Setting expediting repair policy in a multi-echelon repairable-item inventory system with limited repair capacity. J. Oper. Res. Soc. 52(2): 198-209 (2001)
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-25 05:44 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: