Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Journal: Discrete Applied Mathematics
Found
533 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
On the directionality of interval orders
1994,
Bouchitt Vincent
In this note the authors prove that any finite interval order P can be represented in...
On a universal chain problem
1994,
Dyer Martin
M.S. Paterson introduced the idea of a universal chain for a set of points in a...
Stable marriage and indifference
1994,
Irving Robert W.
It is well known that every instance of the classical stable marriage problem admits...
Genetic local search in combinatorial optimization
1994,
Kolen Antoon
The most common application of genetic algorithms to combinatorial optimization...
An extension of elementary bipartite graphs to matroid pairs and its characterization
1994,
Nakamura Masataka
This paper presents a generalization of elementary bipartite graphs to a certain pair...
Strong regularity of matrices-A survey of results
1994,
Butkovic Peter
Let 𝒢=(G,¸ª$,¸•) be a linearly ordered, commutative...
On constructing the elimination tree
1994,
Mutchler David
The authors present a new algorithm for constructing the elimination tree for the...
On the equivalence between roof duality and Lagrangean duality for unconstrained 0-1 quadratic programming problems
1994,
Adams Warren P.
In this paper the authors are concerned with techniques for computing upper bounds on...
An approximation algorithm for a single-machine scheduling problem with release times and delivery times
1994,
Nowicki Eugeniusz
The authors consider the scheduling problem in which jobs with release times and...
Scheduling identical parallel machines to minimize total weighted completion time
1994,
Potts C.N.
A branch and bound algorithm is proposed for the problem of scheduling jobs on...
The single-item discrete lotsizing and scheduling problem: Optimization by linear and dynamic programming
1994,
Van Wassenhove Luk N.
This paper considers the single-item discrete lotsizing and scheduling problem (DLSP)....
Routeing winter gritting vehicles
1994,
Eglese R.W.
When roads may become dangerously slippery due to forst, ice or snow, local...
A set covering reformulation of the pure fixed charge transportation problem
1994,
Larsson Torbjrn
The pure fixed charge transportation problem is reformulated into an equivalent set...
A bijection between convex polyominoes and equations for their enumeration according to their area
1994,
Bousquet-Mlou Mireille
A bijection between convex polyominoes and words of an algebraic language gives a...
Some new results concerning three counterfeit coins problem
1994,
Bosnjak Ivica
The paper considers the problem of ascertaining the minimum number of weighings which...
Most uniform path partitioning and its use in image processing
1993,
Simeone Bruno
Let Q be a vertex-weighted path with n vertices. For any pair ( L,U) can one find a...
A class of generalized greedy algorithms for the multi-knapsack problem
1993,
Vercellis C.
A class of generalized greedy algorithms is proposed for the solution of the {0,1}...
Directed Steiner problems with connectivity constraints
1993,
Dahl Geir
The paper presents a generalization of the Steiner problem in a directed graph. Given...
On the Euclidean two paths problem
1993,
Woeginger Gerhard
Given a set of polygonal obstacles in the Euclidean plane with a total number of n...
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
1993,
Winter Pawel
The notion of Steiner visibility graphs is introduced. Their applicability in...
Trace-orthogonal normal bases
1993,
Jungnickel Dieter
This paper first obtains some basic theoretical results on trace-orthogonal normal...
Coset correlation of LR m-arrays
1993,
Liu Mulan
The normal form and the coset correlation function of an arbitrary linear recurring...
Dating to marriage
1993,
Csima J.
This note is a tongue-in-check description of a sociological application of our...
Directed hypergraphs and applications
1993,
Gallo Giorgio
The authors deal with directed hypergraphs as a tool to model some classes of problems...
First Page
10
11
12
13
14
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers