Found 352 papers in total

2017,

Let G = G ( V , E ) be a graph. A proper coloring of G is a function f : V → N...

2017,

Let F be an edge subset and F ′ a subset of edges and vertices of a graph G . If...

2017,

We study the multi‐agent scheduling on a single machine with a fixed number of...

2017,

In this article, we present new results on the online multi‐agent O–D k...

2017,

The paper is devoted to value concepts for cooperative games with a communication...

2017,

We consider the online scheduling on a single machine, in which jobs are released over...

2017,

Recently, some extensions of Motzkin–Straus theorems were proved for...

2017,

A triple‐solution approach for the rectangular level strip packing problem is...

2017,

This paper deals with the recoverable robust spanning tree problem under interval...

2017,

An edge irregular total k ‐labeling φ : V ∪ E → { 1 , 2 , …...

2017,

For an integer k ≥ 1 , a distance k ‐dominating set of a connected graph G...

2017,

Let G be a connected graph of order n . The long‐standing open and close...

2017,

Let D be any edge orientation of a graph G . We denote by Δ k ( D ) the maximum...

2017,

The maximum weight independent set (MWIS) problem on graphs with vertex weights asks...

2017,

Many large organizations, such as corporations, are hierarchical by nature. In...

2017,

A matching is a set of pairwise disjoint hyperedges of a hypergraph H . The matching...

2017,

In this paper, we consider the single‐machine scheduling problem with...

2017,

Graph pebbling is a network model for studying whether or not a given supply of...

2017,

We consider the problem of scheduling deteriorating jobs or shortening jobs with two...

2017,

A (proper) total‐ k ‐coloring of a graph G is a mapping ϕ : V ( G )...

2017,

Let G = ( V , E ) be a graph. For two vertices u and v in G , we denote d G ( u , v )...

2017,

Wu et al. (Discret Math 313:2696–2701, 2013) conjectured that the vertex set of...

2017,

This study considers an evacuation problem where the evacuees try to escape to the...

2017,

Consider a graph G . A subset of vertices, F , is called a vertex cover P t ( V C P t...

Papers per page:

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