A variation of the assignment problem
Article Abstract:
A variation of the cost minimising assignment problem (CMP) can be used to reduce the overall assignment cost and a surplus supervisory cost. The procedure is presented together with a procedure for identifying an optimal solution. The supervisory cost is dependent on the project completion time. A model can be developed in the case of a transportation problem, and the algorithm presented can be adapted to solve this problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1993
User Contributions:
Comment about this article or add new information about this topic:
An O(m log n) algorithm for the max + sum spanning tree problem
Article Abstract:
An O(m log n) algorithm has been developed for solving the max + sum spanning tree combinatorial optimization problem. The algorithm has a data structure which maintains a family of vertex-disjoined rooted dynamic trees for reoptimization. It computes the value of an optimal solution by solving a minimum spanning tree problem. This approach reduces the computational complexity of the original problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
Fuzzy disk for covering fuzzy points
Article Abstract:
The proposal for making a framework to find a fuzzy disk covering fuzzy points, which are nothing but those present in the set of points of a plane with smallest covering circle problem is considered and discussed. Investigation of special cases can be done using the polynomial algorithms.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Enhancing an algorithm for set covering problems. A tree search algorithm for the crew scheduling problem. A heuristic for Euclidean and rectilinear Steiner problems
- Abstracts: Experiments with dynamic programming algorithms for nonseparable problems. A heuristic for finding embedded network structure in mathematical programmes
- Abstracts: Serial and parallel value iteration algorithms for discounted Markov decision processes. Core, least core and nucleolus for multiple scenario cooperative games
- Abstracts: Evaluating the impact of operating conditions on the performance of appointment scheduling rules in service systems