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
L-polytopes and equiangular lines
1995,
Deza M.
A construction providing sets of equiangular lines from integral lattices is given....
Probabilities within optimal strategies for tournament games
1995,
Fisher David C.
Let T be a tournament. The tournament game on T is: Two players independently pick a...
On the channel capacity of read/write isolated memory
1995,
Cohn Martin
The paper applies graph theory to find upper and lower bounds on the channel capacity...
The one-machine problem with delayed precedence constraints and its use in job shop scheduling
1995,
Balas Egon
The authors study the one machine scheduling problem with release and delivery times...
Clique tree inequalities define facets of the asymmetric traveling salesman polytope
1995,
Fischetti Matteo
This paper solves, in the affermative, the open question of whether the...
Finding all common bases in two matroids
1995,
Fukuda Komei
In this paper, the authors present an algorithm for finding all common bases in two...
Maximizing traveling salesman problem for special matrices
1995,
Gutin G. Blokh, D.
The authors consider the maximizing travelling salesman problem (MTSP) for two special...
On some large-scale LP relaxations for the graph partitioning problem and their optimal solutions
1995,
Minoux M.
The purpose of this paper is to investigate a family of large-scale linear programming...
Mathematics in data communications
1993,
Abaya Efren F.
Various mathematical tools are used to model a computer network, or the processes...
A tabu search heuristic for the vehicle routing problem
1994,
Laporte Gilbert
The purpose of this paper is to describe TABUROUTE, a new tabu search heuristic for...
Lower spacial representation of zoomed structural modeling by nonmetric MDS
1994,
Tsuji Mitsuhiro
A method is proposed for making lower spacial representations of system structures by...
The pin redistribution problem in multi-chip modules
1994,
Cho Jun Dong
The authors introduce the pin redistribution problem (PRP), which arises from layout...
Metagraphs: A tool for modeling decision support systems
1994,
Blanning Robert W.
Most decision support systems (DSS) contain stored data, data analysis procedures, and...
Metagraphs
1995,
Basu A.
Graph-theoretic constructs are widely used in the modeling and analysis of systems....
Linear trees and RNA secondary structure
1994,
Waterman Michael S.
The total number of RNA secondary structures of a given length with a fixed number of...
Feature-based operation sequence generation in CAPP
1995,
Irani S.A.
This research explored in depth the integration of a machinist’s concept of...
A parallel tabu search algorithm for large traveling salesman problems
1994,
Fiechter C.-N.
Tabu search is a general heuristic procedure for global optimization which has been...
Optimal-algorithms for dissemination of information in some interconnection networks
1993,
Hromkovic J.
The problems of gossiping and broadcasting in one-way communication mode are...
Supply centers allocation under budget restrictions minimizing the longest delivery time
1994,
Tsouros C.
Let G=(V,E) be a connected directed graph expressing a distribution network. The...
New heuristic solution procedures for the uniform graph partitioning problem: Extensions and evaluation
1994,
Pirkul H.
The uniform graph partitioning problem can be described as partitioning the nodes of a...
Modeling paradigms for discrete event simulation
1993,
Schruben Lee
This paper reviews modeling paradigms for discrete event simulation. Various...
Signal group: Definitions and algorithms
1993,
Guberinic Slobodan
The traffic control on an intersection consists of permitting and canceling...
Cyclical games with prohibitions
1993,
Karzanov Alexander V.
The authors consider a certain combinatorial game on a digraph for two cases of the...
A randomized algorithm for finding a near-maximum clique and its experimental evaluations
1993,
Takahashi Haruhisa
The so-called Maximum Clique Problem is one of the most famous NP-complete problems...
First Page
42
43
44
45
46
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers