Exact Solution of the Quadratic Knapsack Problem
From MaRDI portal
Publication:4427369
DOI10.1287/ijoc.11.2.125zbMath1034.90521OpenAlexW2137023518WikidataQ58826502 ScholiaQ58826502MaRDI QIDQ4427369
David Pisinger, Paolo Toth, Alberto Caprara
Publication date: 1999
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/64f197116304b3647cd0c8ffb75c90dac31e1f92
Related Items
A new family of facet defining inequalities for the maximum edge-weighted clique problem, Dantzig-Wolfe reformulations for binary quadratic problems, On exact solution approaches for bilevel quadratic 0-1 knapsack problem, Planning personnel retraining: column generation heuristics, Knapsack problems with dependencies through non-additive measures and Choquet integral, A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization, Greedy robust wind farm layout optimization with feasibility guarantee, Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems, Asymptotic behavior of the quadratic knapsack problem, Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs, On a nonseparable convex maximization problem with continuous Knapsack constraints, Generalized quadratic multiple knapsack problem and two solution approaches, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, On the product knapsack problem, Lower bounds for the quadratic minimum spanning tree problem based on reduced cost computation, Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem, A hub location problem with fully interconnected backbone and access networks, Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering, A Branch-and-Bound Algorithm for Team Formation on Social Networks, The quadratic knapsack problem -- a survey, Competitive facility location model with concave demand, Strong RLT1 bounds from decomposable Lagrangean relaxation for some quadratic \(0-1\) optimization problems with linear constraints, Computing representations using hypervolume scalarizations, Variable neighborhood search for large offshore wind farm layout optimization, A cut-and-branch algorithm for the quadratic knapsack problem, Lagrangian matheuristics for the quadratic multiple knapsack problem, A lifted-space dynamic programming algorithm for the quadratic knapsack problem, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, A general purpose exact solution method for mixed integer concave minimization problems, Two-stage quadratic integer programs with stochastic right-hand sides, A Dynamic Programming Heuristic for the Quadratic Knapsack Problem, Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem, On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem, Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem, Quadratic Combinatorial Optimization Using Separable Underestimators, Global optimality conditions and optimization methods for quadratic knapsack problems, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, A note on representations of linear inequalities in non-convex mixed-integer quadratic programs, Solving Quadratic Programming by Cutting Planes, An improved linearization strategy for zero-one quadratic programming problems, Constrained 0-1 quadratic programming: basic approaches and extensions, Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement, A new variable reduction technique for convex integer quadratic programs, Compact linearization for binary quadratic problems, Polyhedral combinatorics of the cardinality constrained quadratic knapsack problem and the quadratic selective travelling salesman problem, On reduction of duality gap in quadratic knapsack problems, Simple solution methods for separable mixed linear and quadratic knapsack problem, A computational study on the quadratic knapsack problem with multiple constraints, Reoptimization in Lagrangian methods for the \(0\)-\(1\) quadratic knapsack problem, Discrete location problems with push-pull objectives, An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, Upper bounds and exact algorithms for \(p\)-dispersion problems, A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems, Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem, Lagrangian heuristics for the quadratic knapsack problem, Theoretical and computational study of several linearisation techniques for binary quadratic problems, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, A Lagrangian Relaxation-Based Heuristic to Solve Large Extended Graph Partitioning Problems, The equitable dispersion problem, Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach, Efficient solution approaches for a discrete multi-facility competitive interaction model, Integer Linear Programming in Computational Biology, Scheduling Personnel Retraining: Column Generation Heuristics, Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem, The submodular knapsack polytope, Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem, Parametric convex quadratic relaxation of the quadratic knapsack problem, An approximate dynamic programming approach to convex quadratic knapsack problems, Iterated responsive threshold search for the quadratic multiple knapsack problem, Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm, A note on semidefinite relaxation for 0-1 quadratic knapsack problems, The nonlinear knapsack problem - algorithms and applications, Cutting planes for RLT relaxations of mixed 0-1 polynomial programs, A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems, The quadratic 0-1 knapsack problem with series-parallel support
Uses Software
