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

Computational Optimization and Applications - Netherlands
doi 10.1007/s10589-018-9988-z
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

A New Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problem

The International Conference on Electrical Engineering
2010English

A Virtual Pegging Approach to the Max–min Optimization of the Bi-Criteria Knapsack Problem

International Journal of Computer Mathematics
Computational TheoryApplied MathematicsComputer Science ApplicationsMathematics
2009English

Algorithms for Approximate Multi-Stage Flow-Shop-Problem Solution

System research and information technologies
2019English

Meta-Heuristics Approach to Knapsack Problem in Memory Management

Asian Journal of Research in Computer Science
2019English

Local Search Heuristic for Multiple Knapsack Problem

International Journal of Intelligent Information Systems
2015English

Memetic Search for the Generalized Quadratic Multiple Knapsack Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2016English

God's Problem of Multiple Choice

Religious Studies
PhilosophyReligious Studies
2006English

An Approximate Analytic Solution of a Particular Boundary Value Problem

International Journal of Mathematics and Mathematical Sciences
Mathematics
2001English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy