Keyword: graphs

Found 1175 papers in total
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
2017,
We study the knapsack problem with conflict graph (KPCG), an extension of the...
A Branch Decomposition Algorithm for the p-Median Problem
A Branch Decomposition Algorithm for the p-Median Problem
2017,
In this paper, we use a branch decomposition technique to improve approximations to...
Branch-cut-price algorithms for solving a class of search problems on general graphs
Branch-cut-price algorithms for solving a class of search problems on general graphs
2017,
We consider graph search problems involving an intruder and mobile searchers. The...
The dependency diagram of a mixed integer linear programme
The dependency diagram of a mixed integer linear programme
2017,
The Dependency Diagram of a Linear Programme (LP) shows how the successive...
A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem
A finite dominating set of cardinality O(k) and a witness set of cardinality O(n) for 1.5D terrain guarding problem
2017,
1.5 dimensional (1.5D) terrain is characterized by a piecewise linear curve. Locating...
Mathematical programming based heuristics for the 0‐1 MIP: a survey
Mathematical programming based heuristics for the 0‐1 MIP: a survey
2017,
The 0–1 mixed integer programming problem is used for modeling many...
Finding near-optimal independent sets at scale
Finding near-optimal independent sets at scale
2017,
The maximum independent set problem is NP‐hard and particularly difficult to...
An extension principle based solution approach for shortest path problem with fuzzy arc lengths
An extension principle based solution approach for shortest path problem with fuzzy arc lengths
2017,
A shortest path problem on a network in the presence of fuzzy arc lengths is focused...
Approachability in Stackelberg Stochastic Games with Vector Costs
Approachability in Stackelberg Stochastic Games with Vector Costs
2017,
The notion of approachability was introduced by Blackwell (Pac J Math 6(1):1–8,...
Examination and visualisation of the simplifying assumption for vine copulas in three dimensions
Examination and visualisation of the simplifying assumption for vine copulas in three dimensions
2017,
Vine copulas are a highly flexible class of dependence models, which are based on the...
Optimal split-plot orthogonal arrays
Optimal split-plot orthogonal arrays
2017,
It is well known that many industrial experiments have split‐plot structures....
A column generation approach for the route planning problem in fourth party logistics
A column generation approach for the route planning problem in fourth party logistics
2017,
In this paper, we address the route planning problem in fourth party logistics (4PL)....
Customizable Route Planning in Road Networks
Customizable Route Planning in Road Networks
2017,
We propose the first routing engine for computing driving directions in...
The Hierarchical Mixed Rural Postman Problem
The Hierarchical Mixed Rural Postman Problem
2017,
In this paper, we study a generalization of the Hierarchical Chinese Postman Problem...
A dynamic ambulance management model for rural areas
A dynamic ambulance management model for rural areas
2017,
We study the Dynamic Ambulance Management (DAM) problem in which one tries to retain...
A heuristic approach for dividing graphs into bi-connected components with a size constraint
A heuristic approach for dividing graphs into bi-connected components with a size constraint
2017,
In this paper we propose a new problem of finding the maximal bi‐connected...
Multiple Response Optimization for Higher Dimensions in Factors and Responses
Multiple Response Optimization for Higher Dimensions in Factors and Responses
2017,
When optimizing a product or process with multiple responses, a two‐stage...
Feasibility check for the distance geometry problem: an application to molecular conformations
Feasibility check for the distance geometry problem: an application to molecular conformations
2017,
The distance geometry problem (DGP) consists in finding an embedding in a metric space...
Evolution-inspired local improvement algorithm solving orienteering problem
Evolution-inspired local improvement algorithm solving orienteering problem
2017,
The orienteering problem (OP) is defined on a graph with scores assigned to the...
Method of Digraphs for Multi-dimensional Screening
Method of Digraphs for Multi-dimensional Screening
2017,
We study a general model of multi‐dimensional screening for discrete types of...
Batched bin packing revisited
Batched bin packing revisited
2017,
We revisit the batched bin packing problem. In this model, items come in K consecutive...
Directed Expected Utility Networks
Directed Expected Utility Networks
2017,
A variety of statistical graphical models have been defined to represent the...
Comparison of metaheuristics for the k-labeled spanning forest problem
Comparison of metaheuristics for the k-labeled spanning forest problem
2017,
In this paper, we study the k‐labeled spanning forest (kLSF) problem in which...
When Is a Network Epidemic Hard to Eliminate?
When Is a Network Epidemic Hard to Eliminate?
2017,
We consider the propagation of a contagion process (‘epidemic’) on a...
Papers per page: