Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods

DOI10.1287/MNSC.24.1.91MaRDI QIDQ4146562zbMATH OpenOpenAlexFDO

Authors Stelios H. Zanakis

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

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(15)

• 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.
• Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem
• 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
• Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm
• On the Determination of Three–Parameter Weibull MLE's
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• Large-scale mixed integer programming: Benders-type heuristics

This page was built for publication: Heuristic 0-1 Linear Programming: An Experimental Comparison of Three Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4146562)