Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.12.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2039844201 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical Cuts on the Unit Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for determining the number of warehouses for storing non-compatible products / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-level search strategy for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A column generation method for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid algorithms for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring relaxation induced neighborhoods to improve MIP solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5692642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric tabu-search for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A grasp-knapsack hybrid for a nurse-scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hard multidimensional multiple choice knapsack problems, an empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved convergent heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling-salesman problem and minimum spanning trees: Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New greedy heuristics for the multiple-choice multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the capacitated concentrator location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Budgeting with bounded multiple-choice constraints. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Multiple-Choice Multidimensional Knapsack Based on the Core / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shrinking Boundary Algorithm for Discrete System Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New convergent heuristics for 0-1 mixed integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of effective heuristics and their application to a variety of knapsack problems / rank
 
Normal rank

Latest revision as of 22:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem
scientific article

    Statements

    Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    \(0\)-\(1\) mixed integer programming
    0 references
    multiple-choice multidimensional knapsack problem
    0 references
    semi-continuous relaxation
    0 references
    hybrid method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references