Journal: Mathematical Methods of Operations Research (Heidelberg)

Found 629 papers in total
Mixed graph colorings
Mixed graph colorings
1997,
A mixed graph GÅ𝒪 contains both undirected edges and directed arcs. A k-...
Denumerable controlled Markov chains with strong average optimality criterion: Bounded & unbounded costs
Denumerable controlled Markov chains with strong average optimality criterion: Bounded & unbounded costs
1996,
This paper studies discrete-time nonlinear controlled stochastic systems, modeled by...
Minimum cost K-forest covers
Minimum cost K-forest covers
1996,
A forest cover of a graph is a spanning forest for which each component has at least...
A homotopy approach for infinite horizon discounted Markov decision processes
A homotopy approach for infinite horizon discounted Markov decision processes
1996,
This paper considers a homotopy deformation approach to solving Markov decision...
Individual blocking probabilities in the loss system GI+Mℝ&bmacr;MℝNℝ0
Individual blocking probabilities in the loss system GI+Mℝ&bmacr;MℝNℝ0
1996,
This paper investigates an N server loss system, where the input is a superposition of...
Notes on equivalent stationary policies in Markov decision processes with total rewards
Notes on equivalent stationary policies in Markov decision processes with total rewards
1996,
The authors construct examples of Markov Decision Processes for which, for a given...
A note on asymptotics of discounted value function and strong 0-discount optimality
A note on asymptotics of discounted value function and strong 0-discount optimality
1996,
The paper considers a Markov decision process with a Borel state space, bounded...
On the value function in constrained control of Markov chains
On the value function in constrained control of Markov chains
1996,
It is known that the value function in an unconstrained Markov decision process with...
On computing average cost optimal policies with application to routing to parallel queues
On computing average cost optimal policies with application to routing to parallel queues
1997,
The Approximating Sequence Method for computation of average cost optimal stationary...
Optimal control in light traffic Markov decision processes
Optimal control in light traffic Markov decision processes
1997,
The authors consider Markov Decision Processes under light traffic conditions. They...
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks
On balanced edge connectivity and applications to some bottleneck augmentation problems in networks
1996,
Let , be two weight functions on the possible edges of a directed or undirected graph...
Strengthened invex and perturbations
Strengthened invex and perturbations
1996,
If the strengthened invex property holds for a constrained minimization problem, then...
Connectedness of super efficient solution sets for set-valued maps in banach spaces
Connectedness of super efficient solution sets for set-valued maps in banach spaces
1996,
This paper studies the connectedness of the super efficient solution sets in convex...
A proximal point algorithm for control approximation problems
A proximal point algorithm for control approximation problems
1996,
The authors consider the optimization problem , which is an extension of a problem...
Optimal replacement strategies for repairable systems
Optimal replacement strategies for repairable systems
1997,
This paper considers repair-replacement models introduced by Lam Yeh, and Stadje and...
An affine scaling algorithm for linear programming problems with inequality constraints
An affine scaling algorithm for linear programming problems with inequality constraints
1996,
A primal, interior point method is developed for linear programming problems for which...
A dual perturbation view of linear programming
A dual perturbation view of linear programming
1996,
Solving standard-form linear programs via perturbation of the primal objective...
Long-step primal-dual target-following algorithms for linear programming
Long-step primal-dual target-following algorithms for linear programming
1996,
In this paper the authors propose a long-step target-following methodology for linear...
Linear programming via a quadratic penalty function
Linear programming via a quadratic penalty function
1996,
The paper uses quadratic penalty functions along with some recent ideas from linear l...
An improved asymptotic analysis of the expected number of pivot steps required by the simplex algorithm
An improved asymptotic analysis of the expected number of pivot steps required by the simplex algorithm
1996,
Let be i.i.d. points uniformly on the unit sphere in , , and let be the random...
New steps in the amazing world of sequences and schedules
New steps in the amazing world of sequences and schedules
1996,
In this paper the authors consider classical shop problems: n jobs have to be...
On unit time open shops with additional restrictions
On unit time open shops with additional restrictions
1996,
The paper considers open shop problems with unit processing times. n jobs have to be...
Optimal makespan schedule for three jobs on two machines
Optimal makespan schedule for three jobs on two machines
1996,
This paper deals with the problem of scheduling three jobs on two machines in order to...
Maximum travelling salesman problem
Maximum travelling salesman problem
1996,
The authors present different types of techniques for designing algorithms with...
Papers per page: