Pages that link to "Item:Q4146562"
From MaRDI portal
The following pages link to Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods (Q4146562):
Displayed 15 items.
- Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm (Q342027) (← links)
- A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
- Large-scale mixed integer programming: Benders-type heuristics (Q789322) (← links)
- Experimentation in optimization (Q1084342) (← links)
- Decentralization of responsibility for site decontamination projects: A budget allocation approach (Q1390197) (← links)
- Three approximation algorithms for solving the generalized segregated storage problem. (Q1426687) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A binary-rounding heuristic for multi-period variable-task-duration assignment problems (Q1919790) (← links)
- Greedy algorithm for the general multidimensional knapsack problem (Q2480198) (← links)
- A simulation study of some simple estimators for the three-parameter weibull distribution (Q3206128) (← links)
- Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach (Q3217446) (← links)
- An experimental sequential solution procedure to stochastic linear programming problems with 0–1 variables (Q3335534) (← links)
- On the Determination of Three–Parameter Weibull MLE's (Q3471393) (← links)