Country: Netherlands

Found 18376 papers in total
On the expected number of assignments in reduced matrices for the linear assignment problem
On the expected number of assignments in reduced matrices for the linear assignment problem
1989,
A linear n×n assignment problem is considered for which the elements of the cost...
An algorithm for the multiprocessor assignment problem
An algorithm for the multiprocessor assignment problem
1989,
An exhaustive search algorithm is presented for the assignment of tasks to processors...
An edge elimination test for the Steiner Problem in graphs
An edge elimination test for the Steiner Problem in graphs
1989,
It is known that before actually solving the Steiner Problem in graphs, reduction...
Generalized edge packings
Generalized edge packings
1989,
An extension of matchings is considered: instead of edges, odd length chains are used,...
On compactness of the space of policies in stochastic dynamic programming
On compactness of the space of policies in stochastic dynamic programming
1989,
For stochastic dynamic programming models with compact, history-dependent action sets,...
A note on order preserving matchings
A note on order preserving matchings
1989,
The authors study order preserving injections or bipartite matchings from poset V 1 to...
Markov and Markov reward model transient analysis: An overview of numerical approaches
Markov and Markov reward model transient analysis: An overview of numerical approaches
1989,
The advent of fault-tolerant, distributed systems has led to increased interest in...
Redundancy in lexicographic goal programming: An empirical approach
Redundancy in lexicographic goal programming: An empirical approach
1989,
The purpose of this paper is to draw attention to modellers on the problems associated...
An example of a nonregular semimontone Q-matrix
An example of a nonregular semimontone Q-matrix
1989,
In their paper, Aganagic and Cottle gave necessary and sufficient conditions for a P 0...
Finding the most vital arcs in a network
Finding the most vital arcs in a network
1989,
Let be a directed, arc weighted network with node set V and arc set A . Associated...
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment
1989,
This paper shows how branch-and-bound and column generation techniques can be combined...
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
A mathematical abstraction of the rearrangeability conjecture for shuffle-exchange networks
1989,
Shuffle-exchange networks have received a great deal of attention as interconnecting...
Distance weighted voting and a single facility location problem
Distance weighted voting and a single facility location problem
1989,
The paper generalizes the notion of a Condorcet point of a network by allowing an...
Bounding the expected time-cost curve for a stochastic PERT network flow
Bounding the expected time-cost curve for a stochastic PERT network flow
1989,
Based on some earlier work by Wollmer on how to approximate the expected time-cost...
Strong formulations for mixed integer programming: A survey
Strong formulations for mixed integer programming: A survey
1989,
The paper attempts to motivate and survey recent research on the use of...
An interactive system for constructing timetables on a PC
An interactive system for constructing timetables on a PC
1989,
A new network flow model is presented for constructing timetables for an adult...
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds
1989,
The polyhedral structure of the convex hull of regions is investigated defined by a...
Submodularity and valid inequalities in capacitated fixed charge networks
Submodularity and valid inequalities in capacitated fixed charge networks
1989,
Using a submodular inequality, and the observation that the flow values in capacitated...
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation
1989,
Determining efficient sequences of X-ray diffraction measurements on a four-circle...
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
Open questions concerning Weiszfeld’s algorithm for the Fermat-Weber location problem
1989,
The Fermat-Weber location problem is to find a point in ℝ n that minimizes the...
The k most vital arcs in the shortest path problem
The k most vital arcs in the shortest path problem
1989,
The k most vital arcs in a network are those whose removal from the network results in...
An augmented Lagrangian decomposition method for block diagonal linear programming problems
An augmented Lagrangian decomposition method for block diagonal linear programming problems
1989,
A new decomposition method for large linear programming problems of angular structure...
On the ℝà-perturbation method for avoiding degeneracy
On the ℝà-perturbation method for avoiding degeneracy
1989,
Although it is NP-complete to decide whether a linear programming problem is...
Average cost expansion sequencing
Average cost expansion sequencing
1989,
The paper derives necessary and sufficient conditions for the optimality of a...
Papers per page: