Country: Netherlands

Found 18376 papers in total
An exact algorithm for the subset sum problem
An exact algorithm for the subset sum problem
2002,
The subset sum problem (SSP) is defined as: ‘Given n positive integers w 1 ,...,...
Circular-arc graph coloring: On chords and circuits in the meeting graph
Circular-arc graph coloring: On chords and circuits in the meeting graph
2002,
In compilers register allocation in loops is usually performed by coloring a...
A branch-and-cut algorithm for the maximum cardinality stable set problem
A branch-and-cut algorithm for the maximum cardinality stable set problem
2001,
We propose a branch-and-cut algorithm for the Maximum Cardinality Stable Set problem....
TSP tour domination and Hamilton cycle decompositions of regular digraphs
TSP tour domination and Hamilton cycle decompositions of regular digraphs
2001,
In this paper, we solve a problem by Glover and Punnen from the context of domination...
Rule extraction from expert heuristics: A comparative study of rough sets with neural networks and ID3
Rule extraction from expert heuristics: A comparative study of rough sets with neural networks and ID3
2002,
The rule extraction capability of neural networks is an issue of interest to many...
Using group theory and transition matrices to study a class of metaheuristic neighborhoods
Using group theory and transition matrices to study a class of metaheuristic neighborhoods
2002,
The one-step conjugative rearrangement neighborhood of all possible incumbent tours in...
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
2002,
The traveling salesman problem (TSP) is a classical combinatorial optimization...
High performing evolutionary techniques for solving complex location problems in industrial system design
High performing evolutionary techniques for solving complex location problems in industrial system design
2001,
We propose an overall reconstruction of the traditional genetic algorithm method so...
Recursive algorithms of parallel matrix computations
Recursive algorithms of parallel matrix computations
2001,
Consideration was given to the recursive approach to the block algorithms of linear...
Evolving system architectures for multimedia network design
Evolving system architectures for multimedia network design
2001,
This paper discusses implementation issues concerning a telecommunications planning...
A representational paradigm for dynamic resource transformation problems
A representational paradigm for dynamic resource transformation problems
2001,
This paper offers a new vocabulary for representing complex problems in a stochastic,...
A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’
A note on ‘a dual-ascent approach to the fixed-charge capacitated network design problem’
2002,
We show by a counterexample that the dual-ascent procedure proposed by Herrmann,...
Lyapunov method for the stability of fluid networks
Lyapunov method for the stability of fluid networks
2001,
One of the primary tools in establishing the stablity of a fluid network is to...
An approach to calculating the probability of retaining the maximal flow
An approach to calculating the probability of retaining the maximal flow
2001,
Consideration is given to the probabilistic flow network whose arcs fail independently...
The NOP-2 modeling language for nonlinear programming
The NOP-2 modeling language for nonlinear programming
2001,
This paper defines the modeling language NOP-2 for specifying general optimization...
Very large scale integration circuit performance optimization by geometric programming
Very large scale integration circuit performance optimization by geometric programming
2001,
Delay of VLSI circuit components can be controlled by varying their sizes. In other...
Estimating the firm value distribution function by entropy optimization and geometric programming
Estimating the firm value distribution function by entropy optimization and geometric programming
2001,
By applying the option pricing theory ideas, this paper models the estimation of firm...
Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback–Leibler distance minimization
Proximity function minimization using multiple Bregman projections, with applications to split feasibility and Kullback–Leibler distance minimization
2001,
Problems in signal detection and image recovery can sometimes be formulated as a...
Nonlinear and geometric programming – current status
Nonlinear and geometric programming – current status
2001,
Great strides have been made in nonlinear programming (NLP) in the last 5 years. In...
The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
The fundamental relations between geometric programming duality, parametric programming duality, and ordinary Lagrangian duality
2001,
Every formulation of mathematical programming duality (known to the author) for...
Proving strong duality for geometric optimization using a conic formulation
Proving strong duality for geometric optimization using a conic formulation
2001,
Geometric optimization is an important class of problems that has many applications,...
Quality tolerancing and conjugate duality
Quality tolerancing and conjugate duality
2001,
This paper studies the relationship between product quality as defined by tolerances...
A cutting plane algorithm for linear reverse convex programs
A cutting plane algorithm for linear reverse convex programs
2001,
In this paper, global optimization of linear programs with an additional reverse...
Algorithms of optimal supply of resources to a group of projects (stochastic networks)
Algorithms of optimal supply of resources to a group of projects (stochastic networks)
2001,
Several concurrently realized PERT -like network projects with random lengths of their...
Papers per page: