Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (Q1761937): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.2010.10.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2037518368 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4773298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / 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: Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time bounds for selection / 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: An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function / 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: An exact algorithm for the 0-1 collapsing knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / 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: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three methods for postoptimal analysis in integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3905076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for 0-1 quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean methods for the 0-1 quadratic knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503045 / 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: Implementing Quicksort programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 22:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
scientific article

    Statements

    Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    reoptimization
    0 references
    Lagrangian relaxation
    0 references
    Lagrangian decomposition
    0 references
    \(0\)-\(1\) quadratic knapsack problem
    0 references
    0 references
    0 references
    0 references
    0 references