Country: Netherlands

Found 18376 papers in total
A generalized subgradient method wtih relaxation step
A generalized subgradient method wtih relaxation step
1995,
The paper studies conditions for convergence of a generalized subgradient algorithm in...
A note on locally Lipschitzian functions
A note on locally Lipschitzian functions
1995,
An oversight in a paper of Correa and Lemaréchal is noted; a counterexample is...
Minimizing the error bound for the dynamic lot size model
Minimizing the error bound for the dynamic lot size model
1995,
In the dynamic lot size model, the production plan for the first few periods is...
A goal-programming method of stochastic allocative data envelopment analysis
A goal-programming method of stochastic allocative data envelopment analysis
1993,
Allocative Data Envelopment Analysis (ADEA) is a version of Data Envelopment Analysis...
Hardware configuration for StarLAN 10 local area networks: An application of integer programming
Hardware configuration for StarLAN 10 local area networks: An application of integer programming
1993,
A StarLAN 10 local area network interconnects computers and printers at 10Mbs/sec...
The multi-lefvel Uncapacitated Facility Location Problem is not submodular
The multi-lefvel Uncapacitated Facility Location Problem is not submodular
1993,
Unlike the Uncapacitated Facility Location Problem submodularity does not hold for the...
Fuzzy sets modeling and optimization for disaster control systems planning
Fuzzy sets modeling and optimization for disaster control systems planning
1996,
Various forms of disasters, natural and man-made abound. Although, to some extent,...
Weighted finite transducers in image processing
Weighted finite transducers in image processing
1995,
Culik and Karhumäki studied weighted finite automata (WFA) as devices computing...
Weighted fractional and integral k-matching in hypergraphs
Weighted fractional and integral k-matching in hypergraphs
1995,
The authors consider the problem of finding polynomial-time approximations of maximal...
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
Stronger Lagrangian bounds by use of slack variables: Applications to machine scheduling problems
1995,
Lagrangian relaxation is a powerful bounding technique that has been applied...
On the role of bottleneck Monge matrices in combinatorial optimization
On the role of bottleneck Monge matrices in combinatorial optimization
1995,
In this short summary of research the paper describes some significant aspects of...
Ideal polytopes and face structures of some combinatorial optimization problems
Ideal polytopes and face structures of some combinatorial optimization problems
1995,
Given a finite set X and a family of ‘feasible’ subsets ℱ of X, the...
A framework for adaptive sorting
A framework for adaptive sorting
1995,
A sorting algorithm is adaptive if it sorts sequences that are close to sorted faster...
A closed-form representation of mixed-integer program value functions
A closed-form representation of mixed-integer program value functions
1995,
The paper identifies a class of formulas computable in polynomial time such that the...
New algorithms for linear k-matroid intersection and matroid k-parity problems
New algorithms for linear k-matroid intersection and matroid k-parity problems
1995,
The paper presents algorithms for the k- Matroid Intersection Problem and for the...
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
Balanced 0, ¸ℝà1-matrices, bicoloring and total dual integrality
1995,
A 0,¸±1-matrix A is balanced if, in every submatrix with two nonzero...
Generating hard and diverse test sets for NP-hard graph problems
Generating hard and diverse test sets for NP-hard graph problems
1995,
In evaluating the performance of approximation algorithms for NP-hard problems, it is...
Applying Lehman’s theorems to packing problems
Applying Lehman’s theorems to packing problems
1995,
A 0-1 matrix A is ideal if the polyhedron Q(A)= conv{ x∈ Q ’...
Segments in enumerating faces
Segments in enumerating faces
1995,
The authors introduce the concept of a segment of a degenerate convex polytope...
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
1996,
This paper shows that facet-inducing inequalities can be incorporated into...
A study of the cyclic scheduling problem on parallel processors
A study of the cyclic scheduling problem on parallel processors
1995,
The authors address the problem of scheduling a set of generic tasks to be perfromed...
A multiple criteria model for new telecommunication service planning
A multiple criteria model for new telecommunication service planning
1993,
The strategic planning of telecommunications networks, namely concerning the...
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
On polynomiality of the Mehrotra-type predictor-corrector interior-point algorithms
1995,
Recently, Mehrotra proposed a predictor-corrector primal-dual interior-point algorithm...
Superlinear primal-dual affine scaling algorithms for LCP
Superlinear primal-dual affine scaling algorithms for LCP
1995,
The authors describe an interior-point algorithm for monotone liner complementarity...
Papers per page: