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
The fuzzy shortest path length and the corresponding shortest path in a network
2005,
Chuang Tzung-Nan
The fuzzy shortest path (SP) problem aims at providing decision makers with the fuzzy...
An unconstrained quadratic binary programming approach to the vertex coloring problem
2005,
Glover Fred
The vertex coloring problem has been the subject of extensive research for many years....
How does Europe make its mind up? Connections, cliques, and compatibility between countries in the Eurovision Song Contest
2005,
Efstathiou Janet
We investigate the complex relationships between countries in the Eurovision Song...
One-way and round-trip center location problems
2005,
Tamir Arie
In the classical p -center problem there is a set V of points (customers) in some...
Selecting telecommunication carriers to obtain volume discounts
2005,
Spieksma Frits C.R.
During 2001 many European markets for mobile phones reached saturation. Hence, mobile...
Order consolidation for batch processing
2005,
Chang Soo Y.
We consider the batch processing of orders where either whole or part of a single...
Model structure analysis through graph theory: partition heuristics and feedback structure decomposition
2004,
Oliva Rogelio
The argument of this article is that it is possible to focus on the structural...
Using integer programming to solve the train-platforming problem
2003,
Billionnet Alain
We consider the problem of assigning trains to the available tracks at a railway...
Multi-criteria minimum cost spanning tree games
2004,
Puerto Justo
The minimum cost spanning tree game (mcst-game) is a well-known model within...
Some constrained partitioning problems and majorization
2004,
Dahl Geir
We consider some constrained partitioning problems for a finite set of objects of...
Representation and management of multiobjective evolutionary algorithm populations based on graphs
2004,
Mateo P.M.
Until now, in the literature, little attention has been paid to the storage and...
Large neighborhood local search for the p-median problem
2005,
Kochetov Yuri
In this paper we consider the well known p -median problem. We introduce a new large...
On approximation of the submodular set cover problem
1999,
Fujito Toshihiro
We design a primal–dual heuristic for the submodular set cover problem and...
The complexity of short schedules for unit execution time bipartite graphs
1999,
Bampis Evripidis
We show that the problem of deciding is there is a schedule of length three for the...
A search game on a cyclic graph
2004,
Kikuta Kensaku
There is a finite cyclic graph. The hider chooses one of all node except the specified...
Algorithms for computing the min-transitive closure and associated partition tree of a symmetric fuzzy relation
2004,
Meyer H. De
Based on a previously derived weight-driven algorithm for the computation of the T...
The tree longest detour problem in a biconnected graph
2004,
Wang Yue-Li
In a biconnected graph, a detour is the best alternative path from a detour-starting...
An algorithm for source location in directed graphs
2005,
Frank Andrs
A polynomial time solution algorithm is described to find a smallest subset R of nodes...
The composition of semi-finished inventories at a solid board plant
2004,
Sierksma Gerard
A solid board factory produces rectangular sheets of cardboard in two different...
Risk transportation via a clique number problem formulation
2004,
Mavrommatis G.
This paper deals with the risk transportation programming problem. A new approach...
Global constraints for round robin tournament scheduling
2004,
Henz Martin
In the presence of side-constraints and optimization criteria, round robin tournament...
Multilevel refinement for combinatorial optimisation problems
2004,
Walshaw Chris
We consider the multilevel paradigm and its potential to aid the solution of...
An Ant Colony Optimization algorithm for the minimum weight vertex cover problem
2004,
Lin Bertrand M.T.
Given an undirected graph and a weighting function defined on the vertex set, the...
One more well-solved case of the multifacility location problem
2004,
Karzanov Alexander V.
Let μ be a metric on a finite set T . We consider a version of the multifacility...
First Page
30
31
32
33
34
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers