Found 533 papers in total

2000,

Let G =( V,E,w ) be an undirected graph with nonnegative edge length function w and...

2000,

This paper considers the nonpreemptive scheduling of a given set of jobs on several...

2000,

Reliability is a major concern in the design of large disk arrays. Hellerstein et al ....

2000,

A Prüfer code of a labeled free tree with n nodes is a sequence of length n...

2000,

Given a permutation graph G with its corresponding permutation π, we present an...

2000,

Many codes and sequences designed for robust or secure communications are built from...

2000,

The paper considers the classic linear assignment problem with a min-sum objective...

2000,

The major results known for the marriage and university admissions problems, the...

2000,

In this paper, a set function ϕ defined on a finite set Ω is said to be an...

2000,

The generalized Steiner tree problem (GSTP) is a variant of the classical Steiner tree...

2000,

In this paper, we consider the reformulation–linearization technique (RLT) of...

2000,

The problem of determining the maximum number of vertex-disjoint subgraphs of a...

2000,

Given a graph G and a positive integer k , denote by G[k] the graph obtained from G by...

2000,

An irredundant set of vertices V′⊆V in a graph G=(V,E) has the property...

2000,

A minimum clique-transversal set MCT(G) of a graph G = (V,E) is a set S⊆V of...

2000,

Feedback vertex problems consist of removing a minimal number of vertices of a...

2000,

We prove that there is no cubic graph with diameter 4 on 40 vertices. This implies...

2000,

Hierarchical decompositions of graphs are interesting for algorithmic purposes. Many...

2000,

A basic model in the study of structural rigidity is a network of rigid bars connected...

2000,

A matching in a graph is a set of edges no two of which share a common vertex. A...

2000,

For every 1≤i≤n , let T i be a rooted star with root ν i is not necessarily...

2000,

A median of a k -tuble ≠ = (x 1 ,…,x k ) of vertices of a finite connected...

2000,

Periodicity of vector orbits in max–min algebra is studied. It is proved that...

2000,

The sparsity of orthogonal matrices which have a column of nonzeros is studied. It is...

Papers per page:

© Copyright 2018 IFORS - The International Federation of Operational Research Societies.