Journal: European Journal of Operational Research

Found 7937 papers in total
Aircrew schedule generation using repeated matching
Aircrew schedule generation using repeated matching
1997,
We consider the Aircrew Scheduling Problem of determining tours of duty (TODs) for...
On the concavity of delivery games
On the concavity of delivery games
1997,
Delivery games, introduced by Hamers, Borm, van de Leensel and Tijs in 1994, are...
Spatial organization of an industrial area: Distribution of the environmental cost and equity policies
Spatial organization of an industrial area: Distribution of the environmental cost and equity policies
1997,
In this paper we introduce a methodology for a spatial organization of an Industrial...
On the connectedness of optimum-degeneracy graphs
On the connectedness of optimum-degeneracy graphs
1996,
So-called optimum-degeneracy graphs describe the structure of the set of primal and...
Random generation of tournaments and asymmetric graphs with given out-degrees
Random generation of tournaments and asymmetric graphs with given out-degrees
1996,
In this paper, we first present a polynomial algorithm which computes a random...
Minimizing the schedule length for a parallel 3D-grid precedence graph
Minimizing the schedule length for a parallel 3D-grid precedence graph
1996,
We consider in this paper an extension of the complexity analysis of parallel...
A generalization of König–Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
A generalization of König–Egervary graphs and heuristics for the maximum independent set problem with improved approximation ratios
1997,
We first study a generalization of the König–Egervary graphs, the class of...
A note on hashing functions and tabu search algorithms
A note on hashing functions and tabu search algorithms
1996,
Woodruff and Zemel present four effective functions that can be used for hashing...
A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
1997,
In this paper we model the run time behaviour of GAs using higher cardinality...
Simple Lagrangian heuristic for the set covering problem
Simple Lagrangian heuristic for the set covering problem
1997,
In this paper a simple Lagrangian heuristic is proposed for the set covering problem....
Optimal production cycles, procurement schedules, and joint investment in an imperfect production system
Optimal production cycles, procurement schedules, and joint investment in an imperfect production system
1997,
In this paper, we consider the simultaneous determination of production cycles for the...
A dynamic lot sizing model with exponential machine breakdowns
A dynamic lot sizing model with exponential machine breakdowns
1997,
This paper addresses the dynamic lot sizing model with the assumption that the...
A dual ascent approach to the fixed-charge capacitated network design problem
A dual ascent approach to the fixed-charge capacitated network design problem
1996,
In this paper we consider the problem of constructing a network over which a number of...
Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures
Variance of the throughput of an N-station production line with no intermediate buffers and time dependent failures
1997,
In this study, the variance of the throughput of an N -station production line with no...
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
A two-machine preemptive openshop scheduling problem: An elementary proof of NP-completeness
1997,
This paper deals with a two-machine preemptive openshop system processing a set of...
Multicommodity flow models for spanning trees with hop constraints
Multicommodity flow models for spanning trees with hop constraints
1996,
In this paper we compare the linear programming relaxations of undirected and directed...
Computational investigations of maximum flow algorithms
Computational investigations of maximum flow algorithms
1997,
The maximum flow algorithm is distinguished by the long line of successive...
The hierarchical network design problem with multiple primary paths
The hierarchical network design problem with multiple primary paths
1997,
In this paper we develop a suboptimal solution for the hierarchical network design...
Multi-objective optimization over convex disjunctive feasible sets using reference points
Multi-objective optimization over convex disjunctive feasible sets using reference points
1997,
In this paper we consider the Multiple Objective Optimization Problem, where concave...
New polynomial bounds for matroidal knapsacks
New polynomial bounds for matroidal knapsacks
1996,
The Matroidal Knapsack Problem (MK) consists in finding the maximum weight basis for a...
A method for convex curve approximation
A method for convex curve approximation
1997,
In this paper, a new sandwich method is introduced to approximate a convex curve in R...
Approximating probability density functions and their convolutions using orthogonal polynomials
Approximating probability density functions and their convolutions using orthogonal polynomials
1996,
This paper describes and tests methods for piecewise polynomial approximation of...
An extended formulation approach to the edge-weighted maximal clique problem
An extended formulation approach to the edge-weighted maximal clique problem
1996,
We consider an extended formulation approach to the edge-weighted maximal clique...
On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems – an improved approach
On the use of the asymptotic forms of the Boolean matrix for designing cellular manufacturing systems – an improved approach
1997,
The use of asymptotic forms of the Boolean matrix for grouping machines and parts is...
Papers per page: