A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems

Cited In (37)

Optimization by ghost image processes in neural networks
Multicriteria integer programming: A (hybrid) dynamic programming recursive approach
A \(K\)-means supported reinforcement learning framework to multi-dimensional knapsack
A heuristic algorithm for resource allocation/reallocation problem
A hybrid approach to discrete mathematical programming
A fuzzy programming approach to multiobjective multidimensional 0-1 knapsack problems
Detecting embedded pure network structures in LP problems
Greedy algorithm for the general multidimensional knapsack problem
A column generation method for the multiple-choice multi-dimensional knapsack problem
Extracting embedded generalized networks from linear programming problems
Heuristic methods and applications: A categorized survey
A Core-Based Exact Algorithm for the Multidimensional Multiple Choice Knapsack Problem
An approximate solution approach for a scenario-based capital budgeting model
Capacity allocation problem with random demands for the rail container carrier
A heuristic algorithm for the multidimensional zero-one knapsack problem
A two-phase kernel search variant for the multidimensional multiple-choice knapsack problem
Modeling multiple plant sourcing decisions
Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
A multi-KP modeling for the maximum-clique problem
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
Zero-one integer programs with few contraints - lower bounding theory
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
Model and algorithms for multi-period sea cargo mix problem
Interdicting attack graphs to protect organizations from cyber attacks: a bi-level defender-attacker model
A constraint selection technique for a class of linear programs
The multidimensional 0-1 knapsack problem: an overview.
The multidimensional 0-1 knapsack problem -- bounds and computational aspects
Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem
A simulated annealing approach to the multiconstraint zero-one knapsack problem
An algorithm of internal feasible directions for linear integer programming
Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
A simple strategy for solving a class of 0-1 integer programming models
Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

This page was built for publication: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems

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