Moshe Sniedovich

Information about the author Moshe Sniedovich will soon be added to the site.

Found 20 papers in total

Wald's mighty maximin: a tutorial

2016

Ever since its appearance on the scene in the 1940s, in the then nascent field of...

Applying the corridor method to a blocks relocation problem

2011

In this paper, we present a corridor method inspired algorithm for a blocks relocation...

The art and science of modeling decision-making under severe uncertainty

2007

For obvious reasons, models for decision–making under severe uncertainty are...

The corridor method: a dynamic programming inspired metaheuristic

2006

This paper presents a dynamic programming inspired metaheuristic called Corridor...

Dijkstra's algorithm revisited: the dynamic programming connexion

2006

Dijkstra's Algorithm is one of the most popular algorithms in computer science. It is...

Dynamic programming: an overview

2006

Dynamic programming is one of the major problem-solving methodologies in a number of...

Hyper sensitivity analysis of portfolio optimization problems

2004

Hyper Sensitivity Analysis (HSA) is an intuitive generalization of conventional...

Towards an AoA-free courseware for the critical path method

2004

One of the mysteries of OR/MS teaching is no doubt the AoA vs AoN syndrome. It poses...

OR/MS games 4: The joy of egg-dropping in Braunschweig and Hong Kong

2003

In this discussion we examine the famous 2-egg puzzle from an OR/MS perspective and...

OR/MS games: 1. A neglected educational resource

2002

Games offer OR/MS lecturers and students important educational resources. However, for...

Towers of Hanoi

2002

In this discussion we examine the famous Towers of Hanoi puzzle from an OR/MS...

Counterfeit coin problem

2002

In this discussion we examine two versions of the famous Counterfeit Coin Problem,...

Algorithms for solving Lagrangian multistage decision problems

2000

This paper considers issues relating to the analysis and solution via dynamic...

Generalized linear programming and sensitivity analysis techniques

1996

In this article the authors report on numerical experiments conducted to assess the...

Experiments with dynamic programming algorithms for nonseparable problems

1993

In this paper the authors report on numerical experiments with dynamic programming...

Quick and elegant in the public domain, code #4

1994

This article argues that modelling a critical path by placing the activities onthe...

The Compact Simplex Method

1993

The vast majority of Operational Research OR textbooks describe the simplex method of...

Code for the primal simplex algorithm for LP problems in standard form

1991

The authors present an APL implementation of the primal simplex algorithm for linear...

The APL phenomenon: An operational research perspective

1989

The author finds it completely incomprehensible that APL has been ignored by the...

$Analysis of a class of fractional programming problems$

Analysis of a class of fractional programming problems

1989

The paper proposes a solution strategy for fractional programming problems of the form...

Papers per page: