Improving heuristics for the frequency assignment problem
Article Abstract:
Lower bounding techniques were employed to address a frequency assignment problem. The techniques, which perform better than direct heuristic application, are specifically proven effective in assignment problems that result from practice since they are often able to achieve good bounds from such kind of constraints. Lower bounding techniques involve identification of best lower bounds from the complete problem's subproblem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1998
User Contributions:
Comment about this article or add new information about this topic:
Mixed integer programming for the 0-1 maximum probability model
Article Abstract:
The 0-1 maximum probability model that consists in maximizing the probability that a certain quantity c(super T)x is greater than a prescribed constant t, where c and x are n vectors is studied. The solution for the problem using mixed integer programming is presented, which reveals that this technique enables to treat instances with up to 100 random variables in a few seconds of CPU time.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
Improving activity-based costing heuristics by higher-level cost drivers
Article Abstract:
The simulations and mixed-integer programming are used to analyze the extent of the sub-optimality incurred by activity-based costing (ABC) heuristics. One of the main findings reveals that a heterogeneity driver, used to proportionalize all costs due to inflexible overhead resources, improves the quality of ABC-heuristics significantly.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2004
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An interactive procedure for multiple objective integer linear programming problems. Computational comparison on the partitioning strategies in multiple choice integer programming
- Abstracts: On the inverse problem of linear programming and its application to minimum weight perfect k-matching
- Abstracts: Dominant, an algorithm for the p-center problem. A new algorithm for the multi-item exponentially discounted optimal selection problem
- Abstracts: Salmon men sue for $1.4bn. Fuel costs a worldwide problem-twin rig workshop told. Pink salmon catch tops 121 million
- Abstracts: Fish skin leather for top designers. Flaws in research models. Knives sharper with steel sheath