Moshe Dror

According to our database1, Moshe Dror authored at least 64 papers between 1979 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Serving many masters: an agent and his principals.
Math. Methods Oper. Res., 2019

2017
The Development of a Smart Map for Minimum "Exertion" Routing Applications.
Proceedings of the 50th Hawaii International Conference on System Sciences, 2017

2016
Elicitation of Strategies in Four Variants of a Round-Robin Tournament: The Case of Goofspiel.
IEEE Trans. Comput. Intell. AI Games, 2016

2015
City streets parking enforcement inspection decisions: The Chinese postman's perspective.
Eur. J. Oper. Res., 2015

2014
Teaching & Learning Guide for Speech Variation, Utility, and Game Theory.
Lang. Linguistics Compass, 2014

2013
Repeated Goofspiel: A Game of Pure Strategy.
IEEE Trans. Comput. Intell. AI Games, 2013

Speech Variation, Utility, and Game Theory.
Lang. Linguistics Compass, 2013

Observations on strategies for Goofspiel.
Proceedings of the 2013 IEEE Conference on Computational Inteligence in Games (CIG), 2013

2012
Universal number partition problem with divisibility.
Discret. Math., 2012

2011
Survey of cooperative inventory games and extensions.
J. Oper. Res. Soc., 2011

2010
Behavioral & Quantitative Game Theory Conference on Future Directions May 14-16, 2010, Fairmont Hotel, Newport Beach, CA.
Games Econ. Behav., 2010

Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem.
Discret. Math. Algorithms Appl., 2010

'Strong'-'weak' precedence in scheduling: Extensions to series-parallel orders.
Discret. Appl. Math., 2010

2009
Deux Chemicals Inc. Goes Just-in-Time.
Interfaces, 2009

2008
Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.
SIAM J. Discret. Math., 2008

Dynamic realization games in newsvendor inventory centralization.
Int. J. Game Theory, 2008

Scheduling malleable tasks with interdependent processing rates: Comments and observations.
Discret. Appl. Math., 2008

2007
Investigating Ahuja-Orlin's large neighbourhood search approach for examination timetabling.
OR Spectr., 2007

Shipment Consolidation: Who Pays for It and How Much?
Manag. Sci., 2007

A tabu-based large neighbourhood search methodology for the capacitated examination timetabling problem.
J. Oper. Res. Soc., 2007

Coordination of purchasing and bidding activities across posted offer and auction markets.
Inf. Syst. E Bus. Manag., 2007

Case-based selection of initialisation heuristics for metaheuristic examination timetabling.
Expert Syst. Appl., 2007

2006
The Tsp and the Sum of its Marginal Values.
Int. J. Comput. Geom. Appl., 2006

Efficient scheduling of periodic information monitoring requests.
Eur. J. Oper. Res., 2006

Improved bounds for vehicle routing solutions.
Discret. Optim., 2006

2005
Solving the generalized minimum spanning tree problem by a branch-and-bound algorithm.
J. Oper. Res. Soc., 2005

Randomized distributed access to mutually exclusive resources.
Adv. Decis. Sci., 2005

2004
Coordination of Purchasing and Bidding Activities across Markets.
Proceedings of the 37th Hawaii International Conference on System Sciences (HICSS-37 2004), 2004

2003
Touring a sequence of polygons.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework.
Transp. Sci., 2002

2001
An interactive graphic presentation for multiobjective linear programming.
Appl. Math. Comput., 2001

2000
Generalized Steiner Problems and Other Variants.
J. Comb. Optim., 2000

Cores of Inventory Centralization Games.
Games Econ. Behav., 2000

Generalized spanning trees.
Eur. J. Oper. Res., 2000

1999
Tree Precedence in Scheduling: The Strong-Weak Distinction.
Inf. Process. Lett., 1999

Real-Time Dispatching: Scheduling Stability and Precedence.
Int. J. Found. Comput. Sci., 1999

On the complexity of a restricted list-coloring problem.
Discret. Math., 1999

Stopping rules for utility functions and the St. Petersburg gamble.
Appl. Math. Comput., 1999

1998
A Decomposition Approach to the Inventory Routing Problem with Satellite Facilities.
Transp. Sci., 1998

Resource Constrained Chain Scheduling of UET Jobs on Two Machines.
Oper. Res., 1998

A project scheduling methodology derivedas an analogue of digital circuit technology.
Ann. Oper. Res., 1998

Intelligent Scheduler for processing help requests on unrelated parallel machines in a computer support administration system.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

A Project Management Tool for Computer-Supported Cooperative Work During Project Planning.
Proceedings of the Thirty-First Annual Hawaii International Conference on System Sciences, 1998

1997
A Generalized Traveling Salesman Problem Approach to the Directed Clustered Rural Postman Problem.
Transp. Sci., 1997

Scheduling Chains to Minimize Mean Flow Time.
Inf. Process. Lett., 1997

Interactive graphical computer application for large-scale cattle feed distribution management.
Decis. Support Syst., 1997

1996
Three stage generalized flowshop: Scheduling civil engineering projects.
J. Glob. Optim., 1996

Reengineering and Adaptation in Evolutionary Interactive Multi-Objective Linear Programming.
Proceedings of the 29th Annual Hawaii International Conference on System Sciences (HICSS-29), 1996

1994
Utilizing Shelve Slots: Sufficiency Conditions for Some Easy Instances of Hard Problems.
J. Complex., 1994

Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW.
Oper. Res., 1994

Vehicle routing with split deliveries.
Discret. Appl. Math., 1994

1993
Vehicle routing with stochastic demands and restricted failures.
ZOR Methods Model. Oper. Res., 1993

Stochastic and Dynamic Models in Transportation.
Oper. Res., 1993

1992
Stochastic Inventory Routing: Route Design with Stockouts and Route Failures.
Transp. Sci., 1992

Openshop Scheduling with Machine Dependent Processing Times.
Discret. Appl. Math., 1992

1991
Intelligent heuristic for FMS scheduling using grouping.
J. Intell. Manuf., 1991

Multiobjective linear programming : Another DSS.
Decis. Support Syst., 1991

1990
The monotonicity of the threshold detection probability in a stochastic accumulation process.
Comput. Oper. Res., 1990

1989
Savings by Split Delivery Routing.
Transp. Sci., 1989

Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks.
Transp. Sci., 1989

Fiberoptic circuit network design under reliability constraints.
IEEE J. Sel. Areas Commun., 1989

1987
Postman tour on a graph with precedence relation on arcs.
Networks, 1987

1986
A vehicle routing improvement algorithm comparison of a "greedy" and a matching implementation for inventory routing.
Comput. Oper. Res., 1986

1979
Routing electric meter readers.
Comput. Oper. Res., 1979


  Loading...