Journal: Discrete Applied Mathematics

Found 533 papers in total
The skeleton of the symmetric Traveling Salesman Polytope
The skeleton of the symmetric Traveling Salesman Polytope
1993,
The vertices of the skeleton of the symmetric Traveling Salesman Polytope are the...
Linear trees and RNA secondary structure
Linear trees and RNA secondary structure
1994,
The total number of RNA secondary structures of a given length with a fixed number of...
Circular avoiding sequences with prescribed sum
Circular avoiding sequences with prescribed sum
1993,
For given positive integers x, n, and s an x- avoiding circular sequence (of positive...
The equivalence classes of linear recurring arrays
The equivalence classes of linear recurring arrays
1993,
In this paper, the number of translation equivalence classes of linear recurring...
A parallel tabu search algorithm for large traveling salesman problems
A parallel tabu search algorithm for large traveling salesman problems
1994,
Tabu search is a general heuristic procedure for global optimization which has been...
Separation of convex sets
Separation of convex sets
1994,
A line L separates a set A from a collection S of plane sets if A is contained in one...
An efficient matching algorithm applied in statistical physics
An efficient matching algorithm applied in statistical physics
1994,
An efficient Operational Research OR matching algorithm for nonbipartite graphs is...
Z-cyclic whist tournaments with a patterned starter initial round
Z-cyclic whist tournaments with a patterned starter initial round
1994,
If v•1 ( mod4) we define a Z- cyclic patterned starter whist tournament on v...
Minimizing the weighted number of tardy task units
Minimizing the weighted number of tardy task units
1994,
The problem of minimizing the weighted number of tardy task units on a single...
Analysis of scheduling problems with typed task systems
Analysis of scheduling problems with typed task systems
1994,
In this paper a scheduling problem has been analysed where each task has a type and...
Two machine open shop scheduling problem with bi-criteria
Two machine open shop scheduling problem with bi-criteria
1994,
In this paper the authors consider a bi-criteria two machine open shop scheduling...
Traffic-light scheduling on the grid
Traffic-light scheduling on the grid
1994,
This paper studies the problem of route scheduling under the telephone model of...
Arborescence polytopes for series-parallel graphs
Arborescence polytopes for series-parallel graphs
1994,
This paper considers some polytopes associated with arborescences in a series-parallel...
Periodic assignment and graph colouring
Periodic assignment and graph colouring
1994,
The authors analyse the problem of executing periodic operations on a minimim number...
Intersection graphs on concatenable subtrees of graphs
Intersection graphs on concatenable subtrees of graphs
1994,
A graph is fraternally oriented if for every three vertices u,v,w the existence of the...
A special planar satisfiability problem and a consequence of its NP-completeness
A special planar satisfiability problem and a consequence of its NP-completeness
1994,
The paper introduces a weaker but still NP-complete satisfiability problem to prove...
The parallel solution of domination problems on chordal and strongly chordal graphs
The parallel solution of domination problems on chordal and strongly chordal graphs
1994,
The authors present efficient parallel algorithms for the domination problem on...
Packing problems in edge-colored graphs
Packing problems in edge-colored graphs
1994,
Let F be a fixed edge-colored graph. The authors consider the problem of packing the...
Linear recognition of pseudo-split graphs
Linear recognition of pseudo-split graphs
1994,
The authors characterize the graphs with no induced 2 K 2 or C 4 and present a...
On sparse languages L such that LL=Σ*
On sparse languages L such that LL=Σ*
1994,
A language L∈Σ * is said to be sparse if L contains a vanishingly small...
On (q, 1)-subnormal q-ary covering codes
On (q, 1)-subnormal q-ary covering codes
1994,
The paper shows that if is a prime power and there exists a ( q, n, M)1 code, i.e. a q...
Some results on greedy algorithm conjectures
Some results on greedy algorithm conjectures
1994,
The case n=4 is proved for two different performance conjectures relating minimal...
Bounds on certain multiplications of affine combinations
Bounds on certain multiplications of affine combinations
1994,
Let A and B be matrices the entries of which are affine combinations of the variables...
A review of combinatorial problems arising in feedforward neural network design
A review of combinatorial problems arising in feedforward neural network design
1994,
This paper is primarily oriented towards discrete mathematics and emphasizes the...
Papers per page: