A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
From MaRDI portal
Publication:4065290
DOI10.1287/mnsc.21.12.1417zbMath0307.90056OpenAlexW2032107708MaRDI QIDQ4065290
Publication date: 1975
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.21.12.1417
Related Items (35)
A multi-KP modeling for the maximum-clique problem ⋮ A simple strategy for solving a class of 0-1 integer programming models ⋮ Optimization by ghost image processes in neural networks ⋮ Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 ⋮ A simulated annealing approach to the multiconstraint zero-one knapsack problem ⋮ A constraint selection technique for a class of linear programs ⋮ Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model ⋮ Model and algorithms for multi-period sea cargo mix problem ⋮ A heuristic algorithm for resource allocation/reallocation problem ⋮ Capacity allocation problem with random demands for the rail container carrier ⋮ Modeling multiple plant sourcing decisions ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem ⋮ A best first search exact algorithm for the multiple-choice multidimensional knapsack problem ⋮ A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem ⋮ Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem ⋮ Greedy algorithm for the general multidimensional knapsack problem ⋮ Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem ⋮ A column generation method for the multiple-choice multi-dimensional knapsack problem ⋮ Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls ⋮ A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem ⋮ An approximate solution approach for a scenario-based capital budgeting model ⋮ A hybrid approach to discrete mathematical programming ⋮ Detecting embedded pure network structures in LP problems ⋮ A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems ⋮ Heuristic methods and applications: A categorized survey ⋮ A heuristic algorithm for the multidimensional zero-one knapsack problem ⋮ Zero-one integer programs with few contraints - lower bounding theory ⋮ Multicriteria integer programming: A (hybrid) dynamic programming recursive approach ⋮ Heuristics and reduction methods for multiple constraints 0-1 linear programming problems ⋮ An algorithm of internal feasible directions for linear integer programming ⋮ Extracting embedded generalized networks from linear programming problems ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects
This page was built for publication: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
