Keyword: graphs

Found 1175 papers in total
Exact Algorithms for the Bottleneck Steiner Tree Problem
Exact Algorithms for the Bottleneck Steiner Tree Problem
2011,
Given n points, called terminals, in the plane ℝ 2 and a positive integer k , the...
Resource‐sharing systems and hypergraph colorings
Resource‐sharing systems and hypergraph colorings
2011,
A resource‐sharing system is modeled by a hypergraph H in which a vertex...
On the vertex characterization of single‐shape partition polytopes
On the vertex characterization of single‐shape partition polytopes
2011,
Given a partition of distinct d ‐dimensional vectors into p parts, the...
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
Parameterized complexity and inapproximability of dominating set problem in chordal and near chordal graphs
2011,
In this paper, we study the parameterized complexity of Dominating Set problem in...
Geometric rounding: a dependent randomized rounding scheme
Geometric rounding: a dependent randomized rounding scheme
2011,
We develop a new dependent randomized rounding method for approximation of a number of...
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem
2011,
In this paper, we first present a binary linear programming formulation for the...
Minimum d‐blockers and d‐transversals in graphs
Minimum d‐blockers and d‐transversals in graphs
2011,
We consider a set V of elements and an optimization problem on V : the search for a...
To lay out or not to lay out?
To lay out or not to lay out?
2011,
The Quadratic Assignment Problem (QAP) is known as one of the most difficult problems...
Improved complexity results for several multifacility location problems on trees
Improved complexity results for several multifacility location problems on trees
2011,
In this paper we consider multifacility location problems on tree networks. On general...
On solving Linear Complementarity Problems by DC programming and DCA
On solving Linear Complementarity Problems by DC programming and DCA
2011,
In this paper, we consider four optimization models for solving the Linear...
Approximating k‐generalized connectivity via collapsing HSTs
Approximating k‐generalized connectivity via collapsing HSTs
2011,
An instance of the k ‐generalized connectivity problem consists of an...
Complexity of the VRP and SDVRP
Complexity of the VRP and SDVRP
2011,
In this paper we study the computational complexity of the vehicle routing problem...
Encoding the dynamics of deterministic systems
Encoding the dynamics of deterministic systems
2011,
We present a model for the dynamics of discrete deterministic systems, based on an...
The flexible blocking job shop with transfer and set‐up times
The flexible blocking job shop with transfer and set‐up times
2011,
The Flexible Blocking Job Shop (FBJS) considered here is a job shop scheduling problem...
Optimal wafer cutting in shuttle layout problems
Optimal wafer cutting in shuttle layout problems
2011,
A major cost in semiconductor manufacturing is the generation of photo masks which are...
A data‐guided lexisearch algorithm for the bottleneck travelling salesman problem
A data‐guided lexisearch algorithm for the bottleneck travelling salesman problem
2011,
The bottleneck travelling salesman problem is to find a Hamiltonian circuit that...
Finding low cost TSP and 2‐matching solutions using certain half‐integer subtour vertices
Finding low cost TSP and 2‐matching solutions using certain half‐integer subtour vertices
2011,
Consider the traveling salesman problem (TSP) defined on the complete graph, where the...
A branch‐and‐cut algorithm for the minimum‐adjacency vertex coloring problem
A branch‐and‐cut algorithm for the minimum‐adjacency vertex coloring problem
2011,
In this work we study a particular way of dealing with interference in combinatorial...
Courcelle’s theorem–A game‐theoretic approach
Courcelle’s theorem–A game‐theoretic approach
2011,
MSO‐definable problems can be solved in linear time on graphs of bounded...
Economic design of two‐stage non‐central chi‐square charts for dependent variables
Economic design of two‐stage non‐central chi‐square charts for dependent variables
2011,
Non‐central chi‐square charts are more effective than the joint X ¯...
Control of discrete event systems with respect to strict duration: Supervision of an industrial manufacturing plant
Control of discrete event systems with respect to strict duration: Supervision of an industrial manufacturing plant
2011,
In this paper, we propose a (max,+)‐based method for the supervision of...
Seat inventory control for sequential multiple flights with customer choice behavior
Seat inventory control for sequential multiple flights with customer choice behavior
2011,
This paper considers a seat inventory control problem in which flights depart...
The covering values for acyclic digraph games
The covering values for acyclic digraph games
2011,
We introduce a novel covering method to compute values for acyclic digraph games, and...
A bonus‐malus approach to project management
A bonus‐malus approach to project management
2011,
This paper concentrates on the management of delayed projects charged with penalty...
Papers per page: