Experiments concerning sequential versus simultaneous maximization of objective function and distance
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1234735
- scientific article; zbMATH DE number 1858037
- scientific article; zbMATH DE number 403955
- On the computational efficiency of multiple objective metaheuristics. The knapsack problem case study
- Generating Multiple Solutions for Mixed Integer Programming Problems
Cites work
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 3945836 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 2209663 (Why is no real title available?)
- Genetically Engineered Decision Trees: Population Diversity Produces Smarter Trees
- Multiple criteria optimization: State of the art annotated bibliographic surveys
- Scatter search and star-paths: Beyond the genetic metaphor
- The multidimensional 0-1 knapsack problem: an overview.
- \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
Cited in
(5)- How to select a small set of diverse solutions to mixed integer programming problems
- Compact representation of near-optimal integer programming solutions
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory
- Enriching Solutions to Combinatorial Problems via Solution Engineering
This page was built for publication: Experiments concerning sequential versus simultaneous maximization of objective function and distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009194)
