Keyword: graphs

Found 1175 papers in total
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
Fast Spatial Decomposition and Closest Pair Computation for Limited Precision Input
2000,
In this paper we show that if the input points to the geometric closest pair problem...
A Unified Approach to Conic Visibility
A Unified Approach to Conic Visibility
2000,
In this paper we present linear time algorithms for computing the shortest path tree...
Linear Size Binary Space Partitions for Uncluttered Scenes
Linear Size Binary Space Partitions for Uncluttered Scenes
2000,
We describe a new and simple method for constructing binary space partitions (BSPs) in...
A column generation approach for the unconstrained binary quadratic programming problem
A column generation approach for the unconstrained binary quadratic programming problem
2012,
This paper proposes a column generation approach based on the Lagrangean relaxation...
On a learning precedence graph concept for the automotive industry
On a learning precedence graph concept for the automotive industry
2012,
Assembly line balancing problems (ALBP) consist in assigning the total workload for...
The projection method for reaching consensus and the regularized power limit of a stochastic matrix
The projection method for reaching consensus and the regularized power limit of a stochastic matrix
2011,
In the coordination/consensus problem for multi‐agent systems, a...
Robust synchronization of dynamical networks with compensation of disturbances
Robust synchronization of dynamical networks with compensation of disturbances
2011,
In this paper, a robust output control scheme is proposed for a linear dynamical...
On the probabilistic min spanning tree Problem
On the probabilistic min spanning tree Problem
2012,
We study a probabilistic optimization model for min spanning tree , where any vertex v...
Consecutive Ones Matrices for Multi‐dimensional Orthogonal Packing Problems
Consecutive Ones Matrices for Multi‐dimensional Orthogonal Packing Problems
2012,
The multi‐dimensional orthogonal packing problem (OPP) is a well studied...
A polyhedral study of lot‐sizing with supplier selection
A polyhedral study of lot‐sizing with supplier selection
2012,
The traditional lot‐sizing problem is to find the least cost production...
Core Routing on Dynamic Time‐Dependent Road Networks
Core Routing on Dynamic Time‐Dependent Road Networks
2012,
Route planning in large‐scale time‐dependent road networks is an...
Finding All Stable Pairs and Solutions to the Many‐to‐Many Stable Matching Problem
Finding All Stable Pairs and Solutions to the Many‐to‐Many Stable Matching Problem
2012,
The many‐to‐many stable matching problem (MM), defined in the context of...
Compensations in the Shapley value and the compensation solutions for graph games
Compensations in the Shapley value and the compensation solutions for graph games
2012,
We consider an alternative expression of the Shapley value that reveals a system of...
A decision model to predict profitability using revised Thompson–Thrall profit ratios in DEA with an application to South Asian banks
A decision model to predict profitability using revised Thompson–Thrall profit ratios in DEA with an application to South Asian banks
2011,
Many researchers in the past have addressed the issue of profitability of banks from...
Blaschke‐Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets
Blaschke‐Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets
2011,
In this paper, we deal with analytic and geometrical properties of geodesic convex...
Continuous Selections, Collectively Fixed Points and Weak Knaster–Kuratowski–Mazurkiewicz Mappings in Optimization
Continuous Selections, Collectively Fixed Points and Weak Knaster–Kuratowski–Mazurkiewicz Mappings in Optimization
2011,
We prove theorems on continuous selections, collectively fixed points, collectively...
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
2012,
This paper presents a new alternative of Lagrangian decomposition based on column...
The hill detouring method for minimizing hinging hyperplanes functions
The hill detouring method for minimizing hinging hyperplanes functions
2012,
This paper studies the problem of minimizing hinging hyperplanes (HH) which is a...
Static Frequency Assignment in Cellular Networks
Static Frequency Assignment in Cellular Networks
2001,
A cellular network is generally modeled as a subgraph of the triangular lattice. In...
Reactive Local Search for the Maximum Clique Problem
Reactive Local Search for the Maximum Clique Problem
2001,
A new Reactive Local Search ( LS ) algorithm is proposed for the solution of the...
An Approximation Algorithm for Circular Arc Colouring
An Approximation Algorithm for Circular Arc Colouring
2001,
We consider the problem of colouring a family of n arcs of a circle. This...
Sample Spaces with Small Bias on Neighborhoods and Error‐Correcting Communication Protocols
Sample Spaces with Small Bias on Neighborhoods and Error‐Correcting Communication Protocols
2001,
We give a deterministic algorithm which, on input an integer n , collection \cal F of...
Geometry Helps in Bottleneck Matching and Related Problems
Geometry Helps in Bottleneck Matching and Related Problems
2001,
Let A and B be two sets of n objects in ℝ d , and let Match be a...
Inapproximability Results for Guarding Polygons and Terrains
Inapproximability Results for Guarding Polygons and Terrains
2001,
Past research on art gallery problems has concentrated almost exclusively on bounds on...
Papers per page: