Country: Germany

Found 3096 papers in total
Tree-sparse convex programs
Tree-sparse convex programs
2002,
Dynamic stochastic programs are prototypical for optimization problems with an...
Unbiased approximation in multicriteria optimization
Unbiased approximation in multicriteria optimization
2002,
Algorithms generating piecewise linear approximations of the nondominated set for...
Approximation algorithms for the traveling salesman problem
Approximation algorithms for the traveling salesman problem
2002,
We first prove that the minimum and maximum traveling salesman problems, their metric...
A polynomial algorithm for P|pj = 1, rj, outtree |ΣCj
A polynomial algorithm for P|pj = 1, rj, outtree |ΣCj
2002,
A polynomial algorithm is proposed for two scheduling problems for which the...
Project scheduling with inventory constraints
Project scheduling with inventory constraints
2002,
Inventory constraints refer to so-called cumulative resources, which can store a...
New light on the portfolio allocation problem
New light on the portfolio allocation problem
2002,
The basics of the mean-variance portfolio optimisation procedure have been well...
Convergence of the optimal values of constrained Markov control processes
Convergence of the optimal values of constrained Markov control processes
2002,
We consider a sequence of discounted cost, constrained Markov control processes (CCPs)...
Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach
Dynamic allocation indices for restless projects and queueing admission control: A polyhedral approach
2002,
This paper develops a polyhedral approach to the design, analysis, and computation of...
Detecting Jacobian sparsity patterns by Bayesian probing
Detecting Jacobian sparsity patterns by Bayesian probing
2002,
In this paper we describe an automatic procedure for successively reducing the set of...
Polyhedral results for two-connected networks with bounded rings
Polyhedral results for two-connected networks with bounded rings
2002,
We study the polyhedron associated with a network design problem which consists in...
On convergence of descent methods for variational inequalities in a Hilbert space
On convergence of descent methods for variational inequalities in a Hilbert space
2002,
In this paper, properties of differentiable gap functions for variational inequalities...
Linear bilevel problems: Genericity results and an efficient method for computing local minima
Linear bilevel problems: Genericity results and an efficient method for computing local minima
2002,
This paper is concerned with linear bilevel problems. These non-convex problems are...
K-epiderivatives for set-valued functions and optimization
K-epiderivatives for set-valued functions and optimization
2002,
Exploiting different tangent cones, many derivatives for set-valued functions have...
Stable multi-sets
Stable multi-sets
2002,
In this paper we introduce a generalization of stable sets: stable multi-sets. A...
A connection between cutting plane theory and the geometry of numbers
A connection between cutting plane theory and the geometry of numbers
2002,
In this paper, we relate several questions about cutting planes to a fundamental...
Self-regular functions and new search directions for linear and semidefinite optimization
Self-regular functions and new search directions for linear and semidefinite optimization
2002,
In this paper, we introduce the notion of a self-regular function. Such a function is...
A decomposition procedure based on approximate Newton directions
A decomposition procedure based on approximate Newton directions
2002,
The efficient solution of large-scale linear and nonlinear optimization problems may...
Local behavior of an iterative framework for generalized equations with nonisolated solutions
Local behavior of an iterative framework for generalized equations with nonisolated solutions
2002,
An iterative framework for solving generalized equations with nonisolated solutions is...
Maximum stable set formulations and heuristics based on continuous optimization
Maximum stable set formulations and heuristics based on continuous optimization
2002,
The stability number α (G) for a given graph G is the size of a maximum stable...
A feasible semismooth asymptotically Newton method for mixed complementarity problems
A feasible semismooth asymptotically Newton method for mixed complementarity problems
2002,
Semismooth Newton methods constitute a major research area for solving mixed...
Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
Extending Dantzig's bound to the bounded multiple-class binary knapsack problem
2002,
The bounded multiple-class binary knapsack problem is a variant of the knapsack...
Two properties of condition numbers for convex programs via implicitly defined barrier functions
Two properties of condition numbers for convex programs via implicitly defined barrier functions
2002,
We study two issues on condition numbers for convex programs: one has to do with the...
Convex extensions and envelopes of lower semi-continuous functions
Convex extensions and envelopes of lower semi-continuous functions
2002,
We define a convex extension of a lower semi-continuous function to be a convex...
Convex optimization problems involving finite autocorrelation sequences
Convex optimization problems involving finite autocorrelation sequences
2002,
We discuss convex optimization problems in which some of the variables are constrained...
Papers per page: