Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods
From MaRDI portal
Publication:4146562
DOI10.1287/mnsc.24.1.91zbMath0369.90086MaRDI QIDQ4146562
Publication date: 1977
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.24.1.91
Related Items
A heuristic algorithm for the multidimensional zero-one knapsack problem, Large-scale mixed integer programming: Benders-type heuristics, Experimentation in optimization, Decentralization of responsibility for site decontamination projects: A budget allocation approach, Three approximation algorithms for solving the generalized segregated storage problem., The multidimensional 0-1 knapsack problem: an overview., Heuristic methods and applications: A categorized survey, A binary-rounding heuristic for multi-period variable-task-duration assignment problems, Greedy algorithm for the general multidimensional knapsack problem, A simulation study of some simple estimators for the three-parameter weibull distribution, Evaluation of Heuristic Algorithms for the TSP: A New Statistical Approach, An experimental sequential solution procedure to stochastic linear programming problems with 0–1 variables, On the Determination of Three–Parameter Weibull MLE's
