Keyword: graphs

Found 1175 papers in total
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria
2016,
We consider a connected graph G with n vertices, p of which are centers, while the...
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
Integer programming formulations for the k-edge-connected 3-hop-constrained network design problem
2016,
In this article, we study the k‐edge‐connected...
Line-broadcasting in complete k-ary trees
Line-broadcasting in complete k-ary trees
2016,
A line‐broadcasting model in a connected graph G = ( V , E ) , | V...
Context-based email classification model
Context-based email classification model
2016,
Context‐based email classification requires understanding of semantic and...
A modified hybrid projection method for solving generalized mixed equilibrium problems and fixed point problems in Banach spaces
A modified hybrid projection method for solving generalized mixed equilibrium problems and fixed point problems in Banach spaces
2011,
In this paper, we introduce a modified new hybrid projection method for finding the...
Probabilistic modelling of security of supply in gas networks and evaluation of new infrastructure
Probabilistic modelling of security of supply in gas networks and evaluation of new infrastructure
2015,
The paper presents a probabilistic model to study security of supply in a gas network....
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
A branch-and-cut algorithm for the Orienteering Arc Routing Problem
2016,
In arc routing problems, customers are located on arcs, and routes of minimum cost...
Unsplittable non-additive capacitated network design using set functions polyhedra
Unsplittable non-additive capacitated network design using set functions polyhedra
2016,
In this paper, we address the Unsplittable Non-Additive Capacitated Network Design...
A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
A two-stage robust optimization approach for the mobile facility fleet sizing and routing problem under uncertainty
2016,
We propose a two-stage robust optimization model for the mobile facility fleet sizing...
A branch-and-cut algorithm for two-level survivable network design problems
A branch-and-cut algorithm for two-level survivable network design problems
2016,
This paper approaches the problem of designing a two-level network protected against...
Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US
Integrated modeling of high performance passenger and freight train planning on shared-use corridors in the US
2015,
This paper studies strategic level train planning for high performance passenger and...
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
Diameter constrained reliability: Complexity, distinguished topologies and asymptotic behavior
2015,
Let G = ( V , E ) be a simple graph with | V | = n vertices and |...
SRLG failure localization using nested m-trails and their application to adaptive probing
SRLG failure localization using nested m-trails and their application to adaptive probing
2015,
This article explores a recently introduced novel technique called the nested...
Optimizing robustness in geometric routing via embedding redundancy and regeneration
Optimizing robustness in geometric routing via embedding redundancy and regeneration
2015,
Geometric routing is an alternative to traditional routing algorithms in which traffic...
Graphical Methods for Influential Data Points in Cluster Analysis
Graphical Methods for Influential Data Points in Cluster Analysis
2016,
In cluster analysis, many numerical measures to detect which data points are...
A parallel hybrid metaheuristic for bicluster editing
A parallel hybrid metaheuristic for bicluster editing
2016,
The bicluster editing problem (BEP) consists of editing (adding or removing) the edges...
Progressive heuristic search for probabilistic planning based on interaction estimates
Progressive heuristic search for probabilistic planning based on interaction estimates
2014,
Development of real planning and scheduling applications often requires the ability to...
DenGraph-HO: a density-based hierarchical graph clustering algorithm
DenGraph-HO: a density-based hierarchical graph clustering algorithm
2014,
DenGraph‐HO is an extension of the density‐based graph clustering...
Edge criticality in secure graph domination
Edge criticality in secure graph domination
2015,
A subset X of the vertex set of a graph G is a secure dominating set of G if X is a...
Arc-based integer programming formulations for three variants of proportional symbol maps
Arc-based integer programming formulations for three variants of proportional symbol maps
2015,
A new formulation is described to create optimal proportional symbol maps. We address...
A branch-and-price-and-cut method for computing an optimal bramble
A branch-and-price-and-cut method for computing an optimal bramble
2015,
Given an undirected graph, a bramble is a set of connected subgraphs (called bramble...
Intersection cuts–standard versus restricted
Intersection cuts–standard versus restricted
2015,
This note is meant to elucidate the difference between intersection cuts as originally...
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
An exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
2015,
The quadratic matching problem (QMP) asks for a matching in a graph that optimises a...
Home location profiling for users in social media
Home location profiling for users in social media
2016,
In this paper, we focus on the problem of estimating the home locations of users in...
Papers per page: