Country: Germany

Found 3096 papers in total
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
Parallel and fast sequential algorithms for undirected edge connectivity augmentation
1999,
In the edge connectivity augmentation problem one wants to find an edge of minimum...
Negative-cycle detection algorithms
Negative-cycle detection algorithms
1999,
We study the problem of finding a negative length cycle in a network. An algorithm for...
Optimal offending in view of the offender's criminal record
Optimal offending in view of the offender's criminal record
1999,
Gary S. Becker's economic approach to crime and punishment was essentially static. In...
The finiteness of the reward function and the optimal function in Markov decision processes
The finiteness of the reward function and the optimal function in Markov decision processes
1999,
This paper studies the discrete time Markov decision processes (MDP) with expected...
Controlled Markov chains with risk-sensitive criteria: Average cost, optimality equations, and optimal solutions
Controlled Markov chains with risk-sensitive criteria: Average cost, optimality equations, and optimal solutions
1999,
We study controlled Markov chains with denumerable state space and bounded costs per...
Bounds for a class of stochastic recursive equations
Bounds for a class of stochastic recursive equations
1999,
In this note we develop a framework for computing upper and lower bounds of an...
Composition duality and maximal monotonicity
Composition duality and maximal monotonicity
1999,
This paper shows how the Attouch–Théra duality principle for operator...
Stability in the presence of degeneracy and error estimation
Stability in the presence of degeneracy and error estimation
1999,
Given an approximation to a local minimizer to a nonlinear optimization problem and to...
Convergence of a simple subgradient level method
Convergence of a simple subgradient level method
1999,
We study the subgradient projection method for convex optimization with...
Proximal quasi-Newton methods for nondifferentiable convex optimization
Proximal quasi-Newton methods for nondifferentiable convex optimization
1999,
This paper proposes an implementable proximal quasi-Newton method for minimizing a...
Partition polytopes over 1-dimensional points
Partition polytopes over 1-dimensional points
1999,
We consider partitions of a finite set whose elements are associated with a single...
Robustness of posynomial geometric programming optima
Robustness of posynomial geometric programming optima
1999,
This paper develops a simple bounding procedure for the optimal value of a posynomial...
The 0–1 knapsack problem with a single continuous variable
The 0–1 knapsack problem with a single continuous variable
1999,
Constraints arising in practice often contain many 0–1 variables and one or a...
A lower bound on the average number of pivot-steps for solving linear programs valid for all variants of the simplex-algorithm
A lower bound on the average number of pivot-steps for solving linear programs valid for all variants of the simplex-algorithm
1999,
In this paper we derive a lower bound on the average complexity of the Simplex-Method...
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
1999,
We propose a family of directions that generalizes many directions proposed so far in...
A QP-free constrained Newton-type method for variational inequality problems
A QP-free constrained Newton-type method for variational inequality problems
1999,
We consider a simply constrained optimization reformulation of the...
A smoothing method for mathematical programs with equilibrium constraints
A smoothing method for mathematical programs with equilibrium constraints
1999,
The mathematical program with equilibrium constraints (MPEC) is an optimization...
A bundle Bregman proximal method for convex nondifferentiable minimization
A bundle Bregman proximal method for convex nondifferentiable minimization
1999,
We give a method for minimizing a convex function f that generates a sequence { x k }...
Q-matrix recognition via secondary and universal polytopes
Q-matrix recognition via secondary and universal polytopes
1999,
A square matrix M is a Q- matrix if every linear complementarity problem x T ( Mx...
Tight representation of logical constraints as cardinality rules
Tight representation of logical constraints as cardinality rules
1999,
A mathematical programming model may contain qualitative as well as quantitative...
Some models for demand functions with advertising
Some models for demand functions with advertising
1999,
We determine the most general demand functions S(p, v) of a single-product depending...
Discounted supply curves and optimal harvesting in a multi-species fishery
Discounted supply curves and optimal harvesting in a multi-species fishery
1999,
In this paper, the problem of exploiting two ecologically interdependent fish stocks...
Degeneracy in the multi-source Weber problem
Degeneracy in the multi-source Weber problem
1999,
This study investigates a new phenomenon of degeneracy in the multi-source Weber...
Threshold advertising rules in a duopoly framework
Threshold advertising rules in a duopoly framework
1999,
In this paper we investigate a duopoly model which describes the dynamics of the...
Papers per page: