Multivariate composite distributions for coefficients in synthetic optimization problems
From MaRDI portal
Publication:1969891
DOI10.1016/S0377-2217(99)00012-0zbMath0959.90028MaRDI QIDQ1969891
Charles H. Reilly, Raymond R. Hill
Publication date: 7 May 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (2)
A family of composite discrete bivariate distributions with uniform marginals for simulating realistic and challenging optimization-problem instances ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A distribution-free approach to inducing rank correlation among input variables
- Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty
- Range restrictions for product-moment correlation matrices
- An algorithm for the bottleneck generalized assignment problem
- Experiments with parallel branch-and-bound algorithms for the set covering problem
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- Discrete bivariate distributions with given marginals and correlation
- A New Algorithm for the 0-1 Knapsack Problem
- Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs
- Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
- Pivot and Complement–A Heuristic for 0-1 Programming
- An Algorithm for Large Zero-One Knapsack Problems
- Single Machine Scheduling to Minimize Total Late Work
- A Rigorous Computational Comparison of Alternative Solution Methods for the Generalized Assignment Problem
- Bivariate Gamma Random Vectors
This page was built for publication: Multivariate composite distributions for coefficients in synthetic optimization problems
