Heuristic Solutions for the Multiple-Choice Multi-Dimension Knapsack Problem

Lecture Notes in Computer Science- Germany

doi 10.1007/3-540-45718-6_71

Full Text

Abstract

Available in

Categories

Computer Science

Theoretical Computer Science

Date

January 1, 2001

Authors

Md Mostofa Akbar

Eric G. Manning

Gholamali C. Shoja

Publisher

Springer Berlin Heidelberg

Related search

Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems

English

A Multi-Criteria Approach to Approximate Solution of Multiple-Choice Knapsack Problem

Computational Optimization and Applications

Computational Mathematics

Applied Mathematics

English

A New Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problem

The International Conference on Electrical Engineering

English

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems

English

Heuristic and Exact Algorithms for the Interval Min–Max Regret Knapsack Problem

INFORMS Journal on Computing

Management Science

Computer Science Applications

Information Systems

Operations Research

English

Memetic Search for the Generalized Quadratic Multiple Knapsack Problem

IEEE Transactions on Evolutionary Computation

Theoretical Computer Science

Computational Theory

English

An Algorithm for Determining the K-Best Solutions of the One-Dimensional Knapsack Problem

Pesquisa Operacional

Management Science

Operations Research

English

Heuristic Cluster Algorithm for Multiple Facility Location-Allocation Problem

RAIRO - Operations Research

Management Science

Computer Science Applications

Operations Research

Theoretical Computer Science

English

Heuristic Algorithms for the Capacitated Location-Routing Problem and the Multi-Depot Vehicle Routing Problem

Management Science

Management Information Systems

Computational Theory

Operations Research

Theoretical Computer Science

English