Keyword: graphs

Found 1175 papers in total
Graphical Analysis for Operation Management: A Graphical Method to Support Operation Decision Making
Graphical Analysis for Operation Management: A Graphical Method to Support Operation Decision Making
2016,
This paper proposes a graphical method to easy decision‐making in industrial...
An Optimal Solution for Test Case Generation Using ROBDD Graph and PSO Algorithm
An Optimal Solution for Test Case Generation Using ROBDD Graph and PSO Algorithm
2016,
Software testing is one of the most important techniques to examine the behavior of...
On the polyhedral structure of two-level lot-sizing problems with supplier selection
On the polyhedral structure of two-level lot-sizing problems with supplier selection
2016,
In this article, we study a two‐level lot‐sizing problem with supplier...
Beyond Model Formulation: Assessment of Novices Graphing, Interpreting, and Writing About Their Model and Solution
Beyond Model Formulation: Assessment of Novices Graphing, Interpreting, and Writing About Their Model and Solution
2016,
Operations Research/Management Science educators need to promote learning outcomes...
A linear time algorithm for optimal k-hop dominating set of a tree
A linear time algorithm for optimal k-hop dominating set of a tree
2016,
We give a linear time algorithm to compute an optimal (minimum) k ‐hop...
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
2016,
In this paper, we characterize the redundant rigidity and the redundant global...
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
2016,
An edge cut S of a connected graph G = ( V , E ) is a k ‐restricted edge cut if...
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
NP-hardness of two edge cover generalizations with applications to control and bribery for approval voting
2016,
Given an undirected graph and an integer q, the Edge Cover problem asks for a subgraph...
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
Paired 2-disjoint path covers of multidimensional torus networks with faulty edges
2016,
A paired k -disjoint path cover (paired k -DPC for short) of a graph is a set of k...
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
Extension of the edge tracing algorithm to disconnected Voronoi skeletons
2016,
One of the ways how to describe spatial relations among balls in Euclidean space is to...
L-visibility drawings of IC-planar graphs
L-visibility drawings of IC-planar graphs
2016,
An IC-plane graph is a topological graph where every edge is crossed at most once and...
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand
2015,
We consider facility location problems where the demand is continuously and uniformly...
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
2016,
We study the mixed capacitated general routing problem (MCGRP) in which a fleet of...
A node-based ILP formulation for the node-weighted dominating Steiner problem
A node-based ILP formulation for the node-weighted dominating Steiner problem
2017,
In this article, we consider the Node‐Weighted Dominating Steiner Problem....
Reduced-size formulations for metric and cut polyhedra in sparse graphs
Reduced-size formulations for metric and cut polyhedra in sparse graphs
2017,
Given a graph G = ( V , E ) with | V | = n and | E | = m ,...
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem
2017,
Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a...
Characterization of the monotone polar of subdifferentials
Characterization of the monotone polar of subdifferentials
2014,
We show that a point is solution of the Minty variational inequality of...
Fuzzy Evaluation of Network Vulnerability
Fuzzy Evaluation of Network Vulnerability
2016,
Vulnerability of networks is not only associated with the ability to resist...
Label- and Level-Invariant Graphical Log-Linear Models
Label- and Level-Invariant Graphical Log-Linear Models
2016,
We introduce two types of graphical log‐linear models: label‐ and...
Graph transformation based simulation model generation
Graph transformation based simulation model generation
2016,
The graph transformation based method presented in this paper can automatically...
A new effective dynamic program for an investment optimization problem
A new effective dynamic program for an investment optimization problem
2016,
After a series of publications of T.E. O’Neil et al. (e.g. in 2010), dynamic...
Problems and methods of network control
Problems and methods of network control
2016,
Control of network systems, or network control, is a rapidly developing field of...
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
2016,
The most commonly used method to tackle the graph partitioning problem in practice is...
Surrogate-RLT cuts for zero‐one integer programs
Surrogate-RLT cuts for zero‐one integer programs
2016,
In this paper, we consider the class of 0–1 integer problems and develop an...
Papers per page: