Keyword: graphs

Found 1175 papers in total
Parameterized complexity and local search approaches for the stable marriage problem with ties
Parameterized complexity and local search approaches for the stable marriage problem with ties
2010,
We consider the variant of the classical Stable Marriage problem where preference...
Housing markets through graphs
Housing markets through graphs
2010,
Housing market is a special type of exchange economy where each agent is endowed with...
Almost stable matchings by truncating the Gale–Shapley algorithm
Almost stable matchings by truncating the Gale–Shapley algorithm
2010,
We show that the ratio of matched individuals to blocking pairs grows linearly with...
Circular stable matching and 3-way kidney transplant
Circular stable matching and 3-way kidney transplant
2010,
We consider the following version of the stable matching problem. Suppose that men...
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
Cheating strategies for the Gale-Shapley algorithm with complete preference lists
2010,
This paper deals with a strategic issue in the stable marriage model with complete...
Assigning papers to referees
Assigning papers to referees
2010,
Refereed conferences require every submission to be reviewed by members of a program...
Parallel simulation algorithm for maintenance optimization based on directed Acyclic Graph
Parallel simulation algorithm for maintenance optimization based on directed Acyclic Graph
2008,
An efficient simulation algorithm for the quantification of reliability performance...
A graph-theoretic approach to evaluate the intensity of barriers in the implementation of FMSs
A graph-theoretic approach to evaluate the intensity of barriers in the implementation of FMSs
2010,
Manufacturing organisations adopt Flexible Manufacturing Systems (FMSs) to meet the...
Block-diagonal semidefinite programming hierarchies for 0/1 programming
Block-diagonal semidefinite programming hierarchies for 0/1 programming
2009,
Lovász and Schrijver, and later Lasserre, proposed hierarchies of semidefinite...
Covering skew-supermodular functions by hypergraphs of minimum total size
Covering skew-supermodular functions by hypergraphs of minimum total size
2009,
The paper presents results related to a theorem of Szigeti on covering symmetric...
Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem
Metaheuristics and cooperative approaches for the Bi-objective Ring Star Problem
2010,
This paper presents and investigates different approaches to solve a new bi-objective...
Learning to rank: a ROC-based graph-theoretic approach
Learning to rank: a ROC-based graph-theoretic approach
2009,
This note summarizes the main results presented in the author's Ph.D. thesis,...
Optimally solving the alternative subgraphs assembly line balancing problem
Optimally solving the alternative subgraphs assembly line balancing problem
2009,
Assembly line balancing problems (ALBP) consist of distributing the total workload for...
An encoding in metaheuristics for the minimum communication spanning tree problem
An encoding in metaheuristics for the minimum communication spanning tree problem
2009,
Problem-specific encodings can improve the performance of metaheuristics, such as...
A mini-max spanning forest approach to the political districting problem
A mini-max spanning forest approach to the political districting problem
2009,
We formulate the problem of political districting as a mini-max spanning forest...
A new approach for scheduling independent tasks with multiple modes
A new approach for scheduling independent tasks with multiple modes
2009,
Heuristic algorithms for scheduling tasks with multiple modes and minimizing the...
Maximum-cover source location problems with objective edge-connectivity three
Maximum-cover source location problems with objective edge-connectivity three
2009,
Given a graph G = ( V , E ), a set of vertices S ⊆ V covers a vertex v ∈ V...
Combinatorial algorithms for data migration to minimize average completion time
Combinatorial algorithms for data migration to minimize average completion time
2009,
The data migration problem is to compute an efficient plan for moving data stored on...
Weighted sum coloring in batch scheduling of conflicting jobs
Weighted sum coloring in batch scheduling of conflicting jobs
2009,
Motivated by applications in batch scheduling of jobs in manufacturing systems and...
Conflict resolution in the scheduling of television commercials
Conflict resolution in the scheduling of television commercials
2009,
We extend a previous model for scheduling commercial advertisements during breaks in...
Enhancing CP-based column generation for integer programs
Enhancing CP-based column generation for integer programs
2009,
This is a summary of the author's Ph.D. thesis supervised by Federico Malucelli and...
Ranking by relational power based on digraphs
Ranking by relational power based on digraphs
2009,
In this paper we examine the ranking of objects whose relative merits are given by a...
Approximable 1-Turn routing problems in all-optical mesh networks
Approximable 1-Turn routing problems in all-optical mesh networks
2009,
In all-optical networks, several communications can be transmitted through the same...
2-Commodity integer network synthesis problem
2-Commodity integer network synthesis problem
2009,
We consider the following 2-commodity, integer network synthesis problem: Given two...
Papers per page: