Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem
From MaRDI portal
Publication:1761937
DOI10.1016/j.cor.2010.10.027zbMath1251.90283OpenAlexW2037518368MaRDI QIDQ1761937
Gérard Plateau, Lucas Létocart, Anass Nagih
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.10.027
Related Items
Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Asymptotic behavior of the quadratic knapsack problem, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, The polynomial robust knapsack problem, A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An adapted step size algorithm for a 0-1 biknapsack Lagrangean dual
- ``Miniaturized linearizations for quadratic 0/1 problems
- The quadratic knapsack problem -- a survey
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem
- An algorithm for the solution of the 0-1 knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- An exact algorithm for the 0-1 collapsing knapsack problem
- Time bounds for selection
- An algorithm for the multiparametric 0--1-integer linear programming problem relative to the objective function
- A semidefinite programming approach to the quadratic knapsack problem
- Lagrangean methods for 0-1 quadratic problems
- A new upper bound for the 0-1 quadratic knapsack problem
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Sensitivity analysis of the Knapsack sharing problem: perturbation of the weight of an item
- Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- Three methods for postoptimal analysis in integer linear programming
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- Fast Approximation Algorithms for Knapsack Problems
- An Algorithm for Large Zero-One Knapsack Problems
- Quadratic knapsack problems
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Exceptional Paper—Parametric and Postoptimality Analysis in Integer Linear Programming
- Implementing Quicksort programs
- Exact Solution of the Quadratic Knapsack Problem
