Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (Q2491319): 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.1007/s10732-005-2634-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047360476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A greedy genetic algorithm for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of very large-scale neighborhood search techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic lagrangean algorithm for the capacitated plant location problem / 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: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350067 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP ejection chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for large multiple knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic Transfer Algorithm for Multivehicle Routing and Scheduling Problems / rank
 
Normal rank

Latest revision as of 15:11, 24 June 2024

scientific article
Language Label Description Also known as
English
Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem
scientific article

    Statements

    Very large-scale neighborhood search for the \(K\)-constraint multiple knapsack problem (English)
    0 references
    0 references
    0 references
    29 May 2006
    0 references
    heuristics
    0 references
    neighborhood search algorithms
    0 references
    knapsack problem
    0 references
    0 references
    0 references
    0 references

    Identifiers