An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (Q1652040): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 4 users not shown)
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: SPOT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Tabu search / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: irace / 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.1016/j.cor.2016.08.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2512265885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming for the \(0-1\) quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3064527 / 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: Exact Solution of the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic tabu list management using the reverse elimination method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The case for strategic oscillation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification-driven tabu search for unconstrained binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Methods For Solving Quadratic 0–1 Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semidefinite programming approach to the quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-cut clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for large scale capacitated arc routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended formulation approach to the edge-weighted maximal clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic knapsack problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4310695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with evolutionary path-relinking for the capacitated arc routing 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 strongly polynomial FPTAS for the symmetric quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective GRASP and tabu search for the 0-1 quadratic knapsack problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 03:05, 16 July 2024

scientific article
Language Label Description Also known as
English
An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem
scientific article

    Statements

    An iterated ``hyperplane exploration'' approach for the quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic knapsack problem
    0 references
    hyperplane exploration
    0 references
    tabu search
    0 references
    variable fixing
    0 references
    heuristics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references