Country: Netherlands

Found 18376 papers in total
Parallel algorithms for the assignment and minimum-cost flow problems
Parallel algorithms for the assignment and minimum-cost flow problems
1993,
Let be a network for an assignment problem with 2 n nodes and m edges, in which the...
Certain expected values in the random assignment problem
Certain expected values in the random assignment problem
1993,
The lower bound is established for the expected minimal cost in the random Assignment...
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems
1993,
The paper presents an greedy algorithm with a worst-case performance ratio for the...
On a cost allocation problem arising from a Capacitated Concentrator Covering problem
On a cost allocation problem arising from a Capacitated Concentrator Covering problem
1993,
The paper formulates a cost allocation problem arising from a Capacitated Concentrator...
Dating to marriage
Dating to marriage
1993,
This note is a tongue-in-check description of a sociological application of our...
Directed hypergraphs and applications
Directed hypergraphs and applications
1993,
The authors deal with directed hypergraphs as a tool to model some classes of problems...
Why should biconnected components be identified first
Why should biconnected components be identified first
1993,
Most graph optimization problems are solved on each connected component of the graph...
A fast randomized algorithm for partitioning a graph into paths of fixed length
A fast randomized algorithm for partitioning a graph into paths of fixed length
1993,
A randomized extension-rotation algorithm is presented to partition an undirected...
Forecasting and trading strategy for the foreign exchange market
Forecasting and trading strategy for the foreign exchange market
1993,
Forecasting of share and currency prices has always been a challenging problem. In...
A comparison of two edge-coloring formulations
A comparison of two edge-coloring formulations
1993,
A fundamental theorem of Vizing relates the maximum degree, ℝ ( G) , of a simple...
Complexity results for the p-median problem with mutual communication
Complexity results for the p-median problem with mutual communication
1993,
The p- median problem with mutual communication is defined as follows: Let G=(V,E) be...
Efficient labelling algorithms for the maximum noncrossing matching problem
Efficient labelling algorithms for the maximum noncrossing matching problem
1993,
Consider a bipartite graph; let’s suppose the origin nodes and the destination...
Hexagonal systems with fixed bonds
Hexagonal systems with fixed bonds
1993,
In this paper the authors give an O( n 2 ) algorithm to determine fixed bonds and...
A greedy heuristic for a minimum-weight forest problem
A greedy heuristic for a minimum-weight forest problem
1993,
Given an undirected edge-weighted graph and a natural number m, the authors consider...
Simulation factor screening using cross-spectral methods
Simulation factor screening using cross-spectral methods
1993,
The authors introduce a qualitative procedure for simulation factor screening which...
Object oriented methodologies in decision and information technologies
Object oriented methodologies in decision and information technologies
1993,
This paper provides an overview of object oriented approaches to problem...
Computing the throughput of a network with dedicated lines
Computing the throughput of a network with dedicated lines
1993,
Suppose that the authors wish to transmit many messages from a node of a network to...
Approximate binary search algorithms for mean cuts and cycles
Approximate binary search algorithms for mean cuts and cycles
1993,
Iwano, Misono, Tezuka, and Fujishige have given an approximate binary search algorithm...
Team theory and neural networks for dynamic routing in traffic and communciation networks
Team theory and neural networks for dynamic routing in traffic and communciation networks
1993,
The dynamic-routing problem in traffic and communication networks is addressed....
An approach to single parameter process design
An approach to single parameter process design
1993,
The authors analyze single parameter process design problems that typically entail...
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
1993,
This paper addresses methods for finding a rectangle of minimum area which encloses...
Weighting in compromise programming: A theorem on shadow prices
Weighting in compromise programming: A theorem on shadow prices
1993,
This paper attempts to justify a weighting system proposed as a normalizer in the...
An improved subgradient method for constrained nondifferentiable optimization
An improved subgradient method for constrained nondifferentiable optimization
1993,
Polyak’s subgradient method for constrained nondifferentiable optimization...
Note on combinatorial optimization with max-linear objective functions
Note on combinatorial optimization with max-linear objective functions
1993,
The authors consider combinatorial optimization problems with a feasible solution set...
Papers per page: