Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (Q537958): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(9 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-010-9552-6 / rank
Normal rank
 
Property / author
 
Property / author: José Rui Figueira / rank
Normal rank
 
Property / author
 
Property / author: José Rui Figueira / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5898963 / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack problem
Property / zbMATH Keywords: knapsack problem / rank
 
Normal rank
Property / zbMATH Keywords
 
multi-objective programming
Property / zbMATH Keywords: multi-objective programming / rank
 
Normal rank
Property / zbMATH Keywords
 
core
Property / zbMATH Keywords: core / rank
 
Normal rank
Property / zbMATH Keywords
 
exact algorithm
Property / zbMATH Keywords: exact algorithm / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: GAMS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ADBASE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10898-010-9552-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067579531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem: an overview. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core concept for the Multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core problems in bi-criteria \(\{0,1\}\)-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto optimality, game theory and equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent developments in multiobjective optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for mixed zero-one multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria branch and bound: a vector maximization algorithm for mixed 0-1 multiple objective linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The identification of nondominated and efficient paths on a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm for bi-objective 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4001824 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scatter search method for the bi-criteria multi-dimensional \(\{0,1\}\)-knapsack problem using surrogate relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-010-9552-6 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:51, 9 December 2024

scientific article
Language Label Description Also known as
English
Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems
scientific article

    Statements

    Using the idea of expanded core for the exact solution of bi-objective multi-dimensional knapsack problems (English)
    0 references
    0 references
    0 references
    0 references
    23 May 2011
    0 references
    knapsack problem
    0 references
    multi-objective programming
    0 references
    core
    0 references
    exact algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers