Keyword: graphs

Found 1175 papers in total
The Wiener maximum quadratic assignment problem
The Wiener maximum quadratic assignment problem
2011,
We investigate a special case of the maximum quadratic assignment problem where one...
Tabu search for the linear ordering problem with cumulative costs
Tabu search for the linear ordering problem with cumulative costs
2011,
Given a matrix of weights, the Linear Ordering Problem (LOP) consists of finding a...
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
2011,
The feasible solutions of the traveling salesman problem with pickup and delivery...
On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures
On qualitatively consistent, transitive and contradictory judgment matrices emerging from multiattribute decision procedures
2011,
Several known and newly introduced classes of positive reciprocal matrices emerging...
Approximating Minimum‐Power Degree and Connectivity Problems
Approximating Minimum‐Power Degree and Connectivity Problems
2011,
Power optimization is a central issue in wireless network design. Given a graph with...
Harsanyi power solutions for graph‐restricted games
Harsanyi power solutions for graph‐restricted games
2011,
We consider cooperative transferable utility games , or simply TU‐games, with...
Adaptive Systems Thinking in Integrated Water Resources Management with Insights into Conflicts over Water Exports
Adaptive Systems Thinking in Integrated Water Resources Management with Insights into Conflicts over Water Exports
2008,
Formal decision analysis techniques involving multiple stakeholders and multiple...
Cooperating local search for the maximum clique problem
Cooperating local search for the maximum clique problem
2011,
The advent of desktop multi‐core computers has dramatically improved the...
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
Clique Relaxations in Social Network Analysis: The Maximum k‐Plex Problem
2011,
This paper introduces and studies the maximum k‐plex problem , which arises in...
Information Collection on a Graph
Information Collection on a Graph
2011,
We derive a knowledge gradient policy for an optimal learning problem on a graph, in...
Probabilistic decision graphs for optimization under uncertainty
Probabilistic decision graphs for optimization under uncertainty
2011,
This paper provides a survey on probabilistic decision graphs for modeling and solving...
Combinatorial synthesis approach employing graph networks
Combinatorial synthesis approach employing graph networks
2008,
The paper proposes a methodology to assist the designer at the initial stages of the...
A cooperative universal data model platform for the data‐centric electronic system‐level design
A cooperative universal data model platform for the data‐centric electronic system‐level design
2008,
The rapidly increasing complexity of integrated circuit design is evolving to a more...
Computing Minimum Cuts by Randomized Search Heuristics
Computing Minimum Cuts by Randomized Search Heuristics
2011,
We study the minimum s ‐ t ‐cut problem in graphs with costs on the...
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
Restricted dynamic programming based neighborhoods for the hop‐constrained minimum spanning tree problem
2011,
In this paper we develop, study and test new neighborhood structures for the...
Visual cryptography on graphs
Visual cryptography on graphs
2011,
In this paper, we consider a new visual cryptography scheme that allows for sharing of...
New dominating sets in social networks
New dominating sets in social networks
2010,
Motivated by applications in social networks, a new type of dominating set has been...
A model for timetabling problems with period spread constraints
A model for timetabling problems with period spread constraints
2011,
The generalized robust colouring problem (GRCP) deals with a robust colouring for a...
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
Submodular Maximization over Multiple Matroids via Generalized Exchange Properties
2010,
Submodular function maximization is a central problem in combinatorial optimization,...
Network flow spanners
Network flow spanners
2010,
In this article, motivated by applications of ordinary (distance) spanners...
A supernodal formulation of vertex colouring with applications in course timetabling
A supernodal formulation of vertex colouring with applications in course timetabling
2010,
For many problems in scheduling and timetabling, the choice of a mathematical...
Probabilistic models for the Steiner Tree problem
Probabilistic models for the Steiner Tree problem
2010,
We consider a probabilistic model for the Steiner Tree problem. Under this model, the...
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
The small world of efficient solutions: empirical evidence from the bi-objective {0,1}-knapsack problem
2010,
The small world phenomenon, Milgram (1967) has inspired the study of real networks...
The stable roommates problem with choice functions
The stable roommates problem with choice functions
2010,
The stable marriage theorem of Gale and Shapley states that for n men and n women...
Papers per page: