Journal: Discrete Applied Mathematics

Found 533 papers in total
Constrained weighted matchings and edge coverings in graphs
Constrained weighted matchings and edge coverings in graphs
1999,
We introduce the problem of finding a maximum weight matching in a graph such that the...
Separable partitions
Separable partitions
1999,
An ordered partition of a set of n points in the d -dimensional Euclidean space is...
Stabbing information of a simple polygon
Stabbing information of a simple polygon
1999,
The purpose of this paper is to investigate a new combinatorial object describing the...
A note on formulations for the A-partition problem on hypergraphs
A note on formulations for the A-partition problem on hypergraphs
1999,
Let H = (V,E) be an undirected hypergraph and A ⊆ V . We consider the problem of...
On a multconstrained model for chromatic scheduling
On a multconstrained model for chromatic scheduling
1999,
A graph coloring model is described for handling some types of chromatic scheduling...
Retractions of finite distance functions onto tree metrics
Retractions of finite distance functions onto tree metrics
1999,
Trees with positively weighted edges induce a natural metric on any subset of...
Learning with queries corrupted by classification noise
Learning with queries corrupted by classification noise
1999,
Kearns introduced the ‘statistical query’ model as a general method for...
Separating lifted odd-hole inequalitites to solve the index selection problem
Separating lifted odd-hole inequalitites to solve the index selection problem
1999,
The Index Selection Problem (ISP) is a phase of fundamental importance in the physical...
Geometric methods to solve max-ordering location problems
Geometric methods to solve max-ordering location problems
1999,
Location problems with Q (in general conflicting) criteria are considered. After...
Solving restricted line location problems via a dual interpretation
Solving restricted line location problems via a dual interpretation
1999,
In line location problems the objective is to find a straight line which minimizes the...
An 0.828-approximation algorithm for the uncapacitated facility location problem
An 0.828-approximation algorithm for the uncapacitated facility location problem
1999,
The uncapacitated facility location problem in the following formulation is...
Data-dependent bounds for the general and the asymmetric stacker–crane problems
Data-dependent bounds for the general and the asymmetric stacker–crane problems
1999,
The Stacker–Crane Problem (SCP) is a sequencing problem, arising in scheduling...
A three-dimensional matching model for perishable production scheduling
A three-dimensional matching model for perishable production scheduling
1999,
In the production of perishable goods, particular stress is often given to performance...
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
The worst-case analysis of the MULTIFIT algorithm for scheduling nonsimultaneous parallel machines
1999,
In this paper we consider the nonsimultaneous multiprocessor scheduling problem, or...
A heuristic for the two-machine open-shop scheduling problem with transportation times
A heuristic for the two-machine open-shop scheduling problem with transportation times
1999,
The paper considers a problem of scheduling n jobs in a two-machine open shop to...
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
An exact method for minimizing the makespan of an application processed on a master slave bus oriented multiprocessor system
1999,
The aim of this paper is to present a branch and bound method for minimizing the...
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags
1999,
Positive and negative time-lags are general timing restrictions between the starting...
List schedules for cyclic scheduling
List schedules for cyclic scheduling
1999,
This paper addresses the definition and properties of list scheduling in the context...
Approximation algorithms for partitioning small items in unequal bins to minimize the total size
Approximation algorithms for partitioning small items in unequal bins to minimize the total size
1999,
A set of items has to be assigned to a set of bins with different sizes. If necessary...
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
Discrete–continuous scheduling to minimize the makespan for power processing rates of jobs
1999,
A class of discrete–continuous scheduling problems is considered when each...
Optimal point-to-point broadcast algorithms via lopsided trees
Optimal point-to-point broadcast algorithms via lopsided trees
1999,
We consider the broadcasting operation in point-to-point packet-switched parallel and...
Inducing an order on cellular automata by a grouping operation
Inducing an order on cellular automata by a grouping operation
1999,
Let X be a one-dimensional cellular automaton. A ‘power of X ’ is another...
How to find a point on a line within a fixed distance
How to find a point on a line within a fixed distance
1999,
It is well known that on a line, a target point in unknown position can be found by...
The minimum spanning tree problem on a planar graph
The minimum spanning tree problem on a planar graph
1995,
Finding a spanning tree of minimum weight is one of the best known graph problems....
Papers per page: