Moshe Kaspi
Affiliations: | Ben-Gurion University of the Negev, Be'er Sheva, South District, Israel |
Area:
Optimization, ModellingGoogle:
"Moshe Kaspi"Mean distance: 106866
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Kaspi M, Zofi M, Teller R. (2019) Maximizing the profit per unit time for the travelling salesman problem Computers & Industrial Engineering. 135: 702-710 |
Teller R, Zofi M, Kaspi M. (2019) Minimizing the average searching time for an object within a graph Computational Optimization and Applications. 74: 517-545 |
Elalouf H, Kaspi M, Elalouf A, et al. (2018) Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: Simulation and response surface methodology Computers & Operations Research. 89: 230-240 |
Zofi M, Teller R, Kaspi M. (2017) Maximizing the profit per unit of time for the TSP with convex resource-dependent travelling times Journal of the Operational Research Society. 68: 1177-1182 |
Hermelin D, Kaspi M, Komusiewicz C, et al. (2016) Parameterized complexity of critical node cuts Theoretical Computer Science. 651: 62-75 |
Shabtay D, Dover O, Kaspi M. (2015) Single-machine two-agent scheduling involving a just-in-time criterion International Journal of Production Research. 53: 2590-2604 |
Shabtay D, Gaspar N, Kaspi M. (2013) A survey on offline scheduling with rejection Journal of Scheduling. 16: 3-28 |
Kaspi M, Zofi M, Teller R. (2013) Maximizing the profit per time unit for the travelling salesman problem 22nd International Conference On Production Research, Icpr 2013 |
Shabtay D, Bensoussan Y, Kaspi M. (2012) A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system International Journal of Production Economics. 136: 67-74 |
Stern HI, Zofi M, Kaspi M. (2011) Solving the Multi Observer 3D Visual Area Coverage Scheduling Problem by Decomposition American Journal of Operations Research. 1: 118-133 |