Journal: Mathematical Methods of Operations Research (Heidelberg)

Found 629 papers in total
A comparison of heuristic algorithms for cost-oriented assembly line balancing
A comparison of heuristic algorithms for cost-oriented assembly line balancing
1992,
Two new heuristic algorithms for solving cost-oriented assembly line balancing...
An integer programming formulation of the Steiner problem in graphs
An integer programming formulation of the Steiner problem in graphs
1993,
A succinct integer linear programming model for the Steiner problem in networks is...
The quickest flow problem
The quickest flow problem
1993,
Consider a network 𝒩=(G,c,τ) where G=(N,A) is a directed graph and c ij and...
Generating structure editor interfaces for Operational Research OR procedures
Generating structure editor interfaces for Operational Research OR procedures
1992,
The quest for Operational Research OR interface development tools that are both...
Weighted reward criteria in Competitive Markov Decision Processes
Weighted reward criteria in Competitive Markov Decision Processes
1992,
The authors consider Competitive Markov Decision Processes in which the...
Markov teams-An analytical approach to process migration in distributed computing systems
Markov teams-An analytical approach to process migration in distributed computing systems
1992,
A process migration mechanism offers a means to exploit the performance reserves...
The O(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix
The O(n3) algorithm for a special case of the maximum cost-to-time ratio cycle problem and its coherence with an eigenproblem of a matrix
1992,
Let two matrices be given, namely a real matrix and a (0, 1)-matrix . For a cyclic...
Time complexity of single machine scheduling with stochastic precedence constraints
Time complexity of single machine scheduling with stochastic precedence constraints
1992,
This paper deals with single machine scheduling problems with stochastic precedence...
A path following algorithm for a class of convex programming problems
A path following algorithm for a class of convex programming problems
1992,
The paper presents a primal-dual path following interior algorithm for a class of...
Insights into the interior-point methods
Insights into the interior-point methods
1992,
In this paper, the authors study the search directions of three important...
On generalized gradients
On generalized gradients
1992,
This paper presents a concept of the construction of generalized gradients by...
Computation of efficient solutions of discretely distributed stochastic optimization problems
Computation of efficient solutions of discretely distributed stochastic optimization problems
1992,
In engineering and economics often a certain vector x of inputs or decisions must be...
New product advertising in dynamic oligopolies
New product advertising in dynamic oligopolies
1992,
The success of the introduction of a new product in a market is very sensitive to the...
Customer waiting times in an (R,S) inventory system with compound Poisson demand
Customer waiting times in an (R,S) inventory system with compound Poisson demand
1992,
Besides service level and mean physical stock, customer waiting time is an important...
On alternative p-center problems
On alternative p-center problems
1992,
Let G=(V,E) be an undirected connected graph with positive edge lengths. The vertex p-...
Calendarization of time planning in MPM networks
Calendarization of time planning in MPM networks
1992,
A calendar contains working days and non-working days. How to make time planning for a...
An optimal choice problem for a set of checking procedures
An optimal choice problem for a set of checking procedures
1992,
An item having a known initial failure probability is to be controlled by some out of...
Optimal assignment of NOP due-dates and sequencing in a single machine shop
Optimal assignment of NOP due-dates and sequencing in a single machine shop
1992,
The paper considers the problem of optimal assignment of NOP due-dates to n jobs and...
Maximizing set function formulation of two scheduling problems
Maximizing set function formulation of two scheduling problems
1992,
In this note two problems are considered: (1)Scheduling n jobs non-preemptively on a...
An unconstrained convex programming view of linear programming
An unconstrained convex programming view of linear programming
1992,
The major interest of this paper is to show that, at least in theory, a pair of primal...
On locally optimal nonparametric tests
On locally optimal nonparametric tests
1992,
There is an abundance of problems in which no parametric model realistically describes...
Transportation problem with nonlinear side constraints: A branch and bound approach
Transportation problem with nonlinear side constraints: A branch and bound approach
1992,
In a container terminal management, the following problem frequently arises: how to...
Impedance-effects in capacity estimation
Impedance-effects in capacity estimation
1992,
Formulas for the capacity of an unsignalized intersection for traffic streams which...
Decisions under risk and uncertainty: A survey of recent developments
Decisions under risk and uncertainty: A survey of recent developments
1992,
This paper reviews recently proposed axiomatic models of choice under uncertainty and...
Papers per page: