Keyword: graphs

Found 1175 papers in total
A Strong Metric Subregularity Analysis of Nonsmooth Mappings Via Steepest Displacement Rate
A Strong Metric Subregularity Analysis of Nonsmooth Mappings Via Steepest Displacement Rate
2016,
In this paper, a systematic study of the strong metric subregularity property of...
Critical hereditary graph classes: a survey
Critical hereditary graph classes: a survey
2016,
The task of complete complexity dichotomy is to clearly distinguish between easy and...
Evolutionary Stability and the Evolution of Cooperation on Heterogeneous Graphs
Evolutionary Stability and the Evolution of Cooperation on Heterogeneous Graphs
2016,
Recent studies have revealed that graph heterogeneity can considerably affect...
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem
2016,
In the Hamiltonian p ‐median problem (HpMP), the target is to find p cycles...
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem
2016,
This paper addresses the close‐enough traveling salesman problem. In this...
On Computation of Generalized Derivatives of the Normal-Cone Mapping and Their Applications
On Computation of Generalized Derivatives of the Normal-Cone Mapping and Their Applications
2016,
The paper concerns the computation of the graphical derivative and the regular...
Risk in a Large Claims Insurance Market with Bipartite Graph Structure
Risk in a Large Claims Insurance Market with Bipartite Graph Structure
2016,
We model the influence of sharing large exogeneous losses to the reinsurance market by...
Inhomogeneous Financial Networks and Contagious Links
Inhomogeneous Financial Networks and Contagious Links
2016,
We propose a framework for testing the possibility of large cascades in financial...
On the 2-Club Polytope of Graphs
On the 2-Club Polytope of Graphs
2016,
A k ‐club is a subset of vertices of a graph that induces a subgraph of...
Computing the number of acute-care beds within NC Certificate of Need
Computing the number of acute-care beds within NC Certificate of Need
2016,
North Carolina’s Certificate of Need legislation is intended to limit...
Characterizing N+-perfect line graphs
Characterizing N+-perfect line graphs
2017,
The aim of this paper is to study the Lovász‐Schrijver PSD operator...
On the complexity of the labeled domination problem in graphs
On the complexity of the labeled domination problem in graphs
2017,
In 2008, a unified approach (labeled domination) to several domination problems...
Maximal independent sets in grid graphs
Maximal independent sets in grid graphs
2017,
A grid graph is the Cartesian product of two path graphs. Enumerating all maximal...
On star and biclique edge-colorings
On star and biclique edge-colorings
2017,
A biclique of G is a maximal set of vertices that induces a complete bipartite...
The maximum-impact coloring polytope
The maximum-impact coloring polytope
2017,
Given two graphs G=(V,EG) and H=(V,EH) over the same set of vertices and given a set...
On the complexity of the {k}-packing function problem
On the complexity of the {k}-packing function problem
2017,
Given a positive integer k, the ‘{k}‐packing function problem’...
Multiobjective project portfolio selection with fuzzy constraints
Multiobjective project portfolio selection with fuzzy constraints
2016,
Decision makers usually have to face a budget and other type of constraints when they...
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
2016,
We consider the 1‐median problem with euclidean distances with uncertainty in...
Exact methods for solving the elementary shortest and longest path problems
Exact methods for solving the elementary shortest and longest path problems
2016,
We consider in this paper the problems of finding the elementary shortest and longest...
An interactive approach for biobjective integer programs under quasiconvex preference functions
An interactive approach for biobjective integer programs under quasiconvex preference functions
2016,
We develop an interactive algorithm for biobjective integer programs that finds the...
Tabu search for solving the black-and-white travelling salesman problem
Tabu search for solving the black-and-white travelling salesman problem
2016,
The black‐and‐white travelling salesman problem (BWTSP) is an extension...
On one class of decision diagrams
On one class of decision diagrams
2016,
A class of decision diagrams for representation of the normal forms of Boolean...
State-defect constraint pairing graph coarsening method for Karush‐Kuhn‐Tucker matrices arising in orthogonal collocation methods for optimal control
State-defect constraint pairing graph coarsening method for Karush‐Kuhn‐Tucker matrices arising in orthogonal collocation methods for optimal control
2016,
A state‐defect constraint pairing graph coarsening method is described for...
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
A polynomial-time nearly-optimal algorithm for an edge coloring problem in outerplanar graphs
2016,
Given a graph G , we study the problem of finding the minimum number of colors...
Papers per page: