Country: Netherlands

Found 18376 papers in total
Smoothing trust region methods for nonlinear complementarity problems with P0-functions
2005,
By using the Fischer–Burmeister function to reformulate the nonlinear...
Goal programming formulation in nutrient management for rice production in West Bengal
2005,
Rice is the dominant crop of West Bengal. Proper nitrogen, phosphorus and potassium...
A relaxed approximate proximal point algorithm
2005,
For a maximal monotone operator T , a well-known overrelaxed point algorithm is often...
An exact solution method for reliability optimization in complex systems
2005,
Systems reliability plays an important part in systems design, operation and...
Relationships between vector variational-like inequality and optimization problems
2004,
In this paper we will establish the relationships between vector variational-like...
Stochastic mathematical programs with equilibrium constraints
1999,
We introduce stochastic mathematical programs with equilibrium constraints (SMPEC),...
An anonymous and failure resilient fair-exchange e-commerce protocol
2005,
In an electronic commerce environment, the merchant and the customer are unlikely to...
Model checking for design and assurance of e-Business processes
2005,
Use of the Internet for electronic business has the potential to revolutionize the way...
Continuity of minimal points with applications to parametric multiple objective optimization
2004,
Basing ourselves on general results we investigate stability of Pareto points to...
An experimental investigation of web-based information systems success in the context of electronic commerce
2005,
In this paper, we examined web-based information systems success and focused on User...
ϵ-optimality for multiobjective programming on a Banach space
2004,
We establish a Langrange multiplier rule, in terms of Clarke generalized gradient,...
Trust in inter-organizational exchanges: a case study in business to business electronic commerce
2005,
Given the uncertainties of online transactions, e-commerce encourages the creation of...
Asynchronous transfer mode: virtual path-based network design
2004,
We consider the problem of designing an ATM VP-based leased line backbone network....
A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization
2004,
We consider a generalized semi-infinite programming problem (GSIP) with one...
Reallocation of paths of available bit rate services in a multistage interconnection network-type asynchronous transfer mode switch network
2004,
In this paper, we develop algorithms for reallocating paths of available bit rate...
Linear semi-openness and the Lyusternik theorem
2004,
A class of set-valued mappings called linearly semi-open mappings is introduced which...
Maximal covering code multiplexing access telecommunication networks
2004,
We present a maximal covering model for the network design of code division...
On the relation between 𝒰-Hessian and second-order epi-derivatives
2004,
We consider second-order objects for a convex function defined as the maximum of a...
Comparing metaheuristic algorithms for Sonet network design problems
2005,
This paper considers two problems that arise in the design of optical...
Products of positive forms, linear matrix inequalities, and Hilbert 17th problem for ternary forms
2004,
A form p on ℝ n (homogeneous n -variate polynomial) is called positive...
Solving the semismooth equivalence problem
2004,
This paper presents a special semismooth system of equations and a suitable...
Existence of a solution to nonlinear variational inequality under generalized positive homogeneity
1999,
We establish several new existence theorems for nonlinear variational inequalities...
On the convergence of the block linear Gauss–Seidel method under convex constraints
2000,
We give new convergence results for the block Gauss–Seidel method for problems...
A simulated annealing approach for the circular cutting problem
2004,
We propose a heuristic for the constrained and unconstrained circular cutting problem...
Papers per page: