Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm

From MaRDI portal
Publication:2093908
Jump to:navigation, search

DOI10.1007/978-3-030-58930-1_4zbMath1505.90103OpenAlexW3112099120MaRDI QIDQ2093908

Ozgur Kabadurmus, M. Fatih Tasgetiren, Hande Oztop, M. Serdar Erdogan

Publication date: 27 October 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-58930-1_4


zbMATH Keywords

Pareto-optimal solution setbinary genetic algorithm


Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)


Related Items (1)

A constraint handling technique using compound distance for solving constrained multi-objective optimization problems







This page was built for publication: Solving 0-1 bi-objective multi-dimensional knapsack problems using binary genetic algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2093908&oldid=14581933"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki