Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: graphs
Found
1175 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Graphical Analysis for Operation Management: A Graphical Method to Support Operation Decision Making
2016,
Crespo Mrquez Adolfo
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
2016,
Kalaee Akram
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
2016,
Guan Yongpei
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
2016,
Williams Julie Ann Stuart
Operations Research/Management Science educators need to promote learning outcomes...
A linear time algorithm for optimal k-hop dominating set of a tree
2016,
Kundu Sukhamay
We give a linear time algorithm to compute an optimal (minimum) k ‐hop...
Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs
2016,
Katoh Naoki
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
2016,
Yuan Jun
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
2016,
Talmon Nimrod
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
2016,
Chen Xie-Bin
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
2016,
Manak Martin
One of the ways how to describe spatial relations among balls in Euclidean space is to...
L-visibility drawings of IC-planar graphs
2016,
Liotta Giuseppe
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
2015,
Berman Oded
We consider facility location problems where the demand is continuously and uniformly...
An Adaptive Iterated Local Search for the Mixed Capacitated General Routing Problem
2016,
DellAmico Mauro
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
2017,
Ljubic Ivana
In this article, we consider the Node‐Weighted Dominating Steiner Problem....
Reduced-size formulations for metric and cut polyhedra in sparse graphs
2017,
Minoux Michel
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
2017,
Gabrel Virginie
Given an undirected graph, the Vertex Coloring Problem (VCP) consists of assigning a...
Characterization of the monotone polar of subdifferentials
2014,
Lassonde Marc
We show that a point is solution of the Minty variational inequality of...
Fuzzy Evaluation of Network Vulnerability
2016,
Zhang Rong
Vulnerability of networks is not only associated with the ability to resist...
Label- and Level-Invariant Graphical Log-Linear Models
2016,
Ramrez-Aldana Ricardo
We introduce two types of graphical log‐linear models: label‐ and...
Graph transformation based simulation model generation
2016,
Verbraeck A
The graph transformation based method presented in this paper can automatically...
A new effective dynamic program for an investment optimization problem
2016,
Dolgui A
After a series of publications of T.E. O’Neil et al. (e.g. in 2010), dynamic...
Problems and methods of network control
2016,
Fradkov A
Control of network systems, or network control, is a rapidly developing field of...
Partitioning (hierarchically clustered) complex networks via size-constrained graph clustering
2016,
Sanders Peter
The most commonly used method to tackle the graph partitioning problem in practice is...
Surrogate-RLT cuts for zero‐one integer programs
2016,
Lee Youngho
In this paper, we consider the class of 0–1 integer problems and develop an...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers