Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
type: Item
instance of: scholarly article
title: Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
zbMATH Open document ID: 1251.90283
author: Gérard Plateau
author: L. Létocart
author: A. Nagih
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6107436
zbMATH Keywords: reoptimization
zbMATH Keywords: Lagrangian relaxation
zbMATH Keywords: Lagrangian decomposition
zbMATH Keywords: \(0\)-\(1\) quadratic knapsack problem
describes a project that uses: Knapsack
describes a project that uses: Quicksort
MaRDI profile type: Publication
full work available at URL: j.cor.2010.10.027
OpenAlex ID: W2037518368
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Q4773298
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: An Algorithm for Large Zero-One Knapsack Problems
cites work: Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
cites work: Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
cites work: A new upper bound for the 0-1 quadratic knapsack problem
cites work: Using a mixed integer programming tool for solving the 0-1 quadratic knapsack problem
cites work: Time bounds for selection
cites work: Exact Solution of the Quadratic Knapsack Problem
cites work: An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
cites work: An algorithm for the solution of the 0-1 knapsack problem
cites work: An exact algorithm for the 0-1 collapsing knapsack problem
cites work: Quadratic knapsack problems
cites work: Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems
cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
cites work: Three methods for postoptimal analysis in integer linear programming
cites work: Fast Approximation Algorithms for Knapsack Problems
cites work: Q3905076
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: Lagrangean methods for 0-1 quadratic problems
cites work: Lagrangean methods for the 0-1 quadratic knapsack problem
cites work: Q4503045
cites work: The quadratic knapsack problem -- a survey
cites work: Solution of large quadratic knapsack problems through aggressive reduction
cites work: Implementing Quicksort programs
cites work: An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
cites work: Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
DOI: 10.1016/J.COR.2010.10.027
description: scientific article; zbMATH DE number 6107436