Country: Netherlands

Found 18376 papers in total
Subtrees of bipartite digraphs the minimum degree condition
Subtrees of bipartite digraphs the minimum degree condition
2000,
Let D be a bipartite digraph and let T be an oriented tree of order k . We consider...
How to survive while visiting a graph
How to survive while visiting a graph
2000,
A visit of a graph is a permutation of its vertices which establishes the order in...
Recognition and isomorphism of tree-like P4-connected graphs
Recognition and isomorphism of tree-like P4-connected graphs
2000,
A graph is P 4 -connected if, for every partition of its vertices into two nonempty...
Not every 2-tough graph is Hamiltonian
Not every 2-tough graph is Hamiltonian
2000,
We present (9/4–•)-tough graphs without a Hamilton path for arbitrary...
Chordality and 2-factors in tough graphs
Chordality and 2-factors in tough graphs
2000,
A graph G is chordal if it contains no chordless cycle of length at least four and is...
Recognizing the P4-structure of block graphs
Recognizing the P4-structure of block graphs
2000,
A 4-uniform hypergraph represents the P 4 -structure of a graph G , if its hyperedges...
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
2000,
A graph is distance hereditary if it preserves distances in all its connected induced...
Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs
Strongly orderable graphs: A common generalization of strongly chordal and chordal bipartite graphs
2000,
In this paper those graphs are studied for which a so-called strong ordering of the...
On the classification of NP-complete problems in terms of their correlation coefficient
On the classification of NP-complete problems in terms of their correlation coefficient
2000,
Local search and its variants simulated annealing and tabu search are very popular...
On approximating higher order Markovian arrival processes (MAPs) with MAPs of order two
On approximating higher order Markovian arrival processes (MAPs) with MAPs of order two
2000,
We show that the autocorrelation sequence of interarrival times for a Markovian...
On complexity, representation and approximation of integral multicommodity flows
On complexity, representation and approximation of integral multicommodity flows
2000,
The paper has two parts. In the algorithmic part integer inequality systems of packing...
‘More (same)-for-less’ paradox in minimal cost network flow problem
‘More (same)-for-less’ paradox in minimal cost network flow problem
1995,
In this paper, the conditions that govern the existence of the...
Continuous optimization by a variant of simulated annealing
Continuous optimization by a variant of simulated annealing
1996,
A variant of the simulated annealing algorithm, based on the generalized method of...
A comparison of two algorithms for the assignment problem
A comparison of two algorithms for the assignment problem
1995,
State-of-the-art computational results have shown that the shortest augmenting path...
Directed perturbation analysis of an integer program
Directed perturbation analysis of an integer program
1996,
In this paper, we examine the largest tolerance levels in integer programming (IP)...
Neural network technique for fuzzy multiobjective linear programming
Neural network technique for fuzzy multiobjective linear programming
1998,
Neural Network (NN) is well-known as one of powerful computing tools to solve...
A partial updating algorithm for linear programs with many more variables than constraints
A partial updating algorithm for linear programs with many more variables than constraints
1995,
We present a modified version of Ye's potential reduction algorithm for linear...
Spanning tree-based genetic algorithm for bicriteria transportation problem
Spanning tree-based genetic algorithm for bicriteria transportation problem
1998,
In this paper, we present a new approach which is spanning tree-based genetic...
The maximum travelling salesman problem on symmetric Demidenko matrices
The maximum travelling salesman problem on symmetric Demidenko matrices
2000,
It is well-known that the Travelling Salesman Problem (TSP) is solvable in polynomial...
Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness
Scheduling identical jobs with unequal ready times on uniform parallel machines to minimize the maximum lateness
1998,
We consider the problem of scheduling n identical jobs with unequal ready times on m...
A heuristic procedure for makespan minimization in job shops with multiple identical processors
A heuristic procedure for makespan minimization in job shops with multiple identical processors
1998,
Scheduling has been and continues to be a major issue in production planning. Job shop...
The sensitivity of jobshop due date lead time to changes in the processing time
The sensitivity of jobshop due date lead time to changes in the processing time
1998,
This paper provides a procedure for calculating the sensitivity of the production lead...
Single server retrial queues with priority calls
Single server retrial queues with priority calls
1999,
We present a survey of retrial queues with two types of calls and present new results...
Multi-objective scheduling with fuzzy due-date
Multi-objective scheduling with fuzzy due-date
1998,
In this paper, we examine the characteristic features of multi-objective scheduling...
Papers per page: