Quadratic knapsack problems
From MaRDI portal
Publication:3912370
DOI10.1007/BFB0120892zbMath0462.90068OpenAlexW2250294758WikidataQ56050297 ScholiaQ56050297MaRDI QIDQ3912370
Peter L. Hammer, Giorgio Gallo, Bruno Simeone
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120892
branch-and-boundheuristic algorithmlinear relaxationnumerical experiencerandomly generated test problemsquadratic knapsack problemsupper planeimproving procedure
Numerical mathematical programming methods (65K05) Integer programming (90C10) Quadratic programming (90C20) Boolean programming (90C09)
Related Items (only showing first 100 items - show all)
Quadratic bottleneck knapsack problems ⋮ \(f\)-flip strategies for unconstrained binary quadratic programming ⋮ Exploiting symmetries in mathematical programming via orbital independence ⋮ On exact solution approaches for bilevel quadratic 0-1 knapsack problem ⋮ Packing Under Convex Quadratic Constraints ⋮ A column generation approach to job grouping for flexible manufacturing systems ⋮ On the magnetisation of the ground states in two dimensional Ising spin glasses ⋮ A quadratic integer program for the location of interacting hub facilities ⋮ Knapsack problems with dependencies through non-additive measures and Choquet integral ⋮ 0-1 quadratic knapsack problem solved with VNS algorithm ⋮ Unnamed Item ⋮ An ejection chain approach for the quadratic multiple knapsack problem ⋮ Asymptotic behavior of the quadratic knapsack problem ⋮ Computational aspects of a branch and bound algorithm for quadratic zero- one programming ⋮ An algorithm for indefinite integer quadratic programming ⋮ On a nonseparable convex maximization problem with continuous Knapsack constraints ⋮ Generalized quadratic multiple knapsack problem and two solution approaches ⋮ Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems ⋮ 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 ⋮ On the rectangular knapsack problem ⋮ Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering ⋮ The quadratic knapsack problem -- a survey ⋮ Diversification-driven tabu search for unconstrained binary quadratic problems ⋮ Dual mean field annealing scheme for binary optimization under linear constraints ⋮ A hybrid metaheuristic approach to solving the UBQP problem ⋮ A cut-and-branch algorithm for the quadratic knapsack problem ⋮ Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem ⋮ A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ A Dynamic Programming Heuristic for the Quadratic Knapsack Problem ⋮ LAD models, trees, and an analog of the fundamental theorem of arithmetic ⋮ Bounds for Random Binary Quadratic Programs ⋮ 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 ⋮ Solving unconstrained binary quadratic programming problem by global equilibrium search ⋮ Global optimality conditions and optimization methods for quadratic knapsack problems ⋮ An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating ⋮ Models and methods of solution of quadratic integer programming problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Quadratic bottleneck problems ⋮ Solving Quadratic Programming by Cutting Planes ⋮ Optimization methods for mixed integer weakly concave programming problems ⋮ Unnamed Item ⋮ 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 Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Nonlinear integer programming for various forms of constraints ⋮ 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 ⋮ Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning ⋮ Discrete location problems with push-pull objectives ⋮ Lower planes for the network design problem ⋮ An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem ⋮ Upper bounds and exact algorithms for \(p\)-dispersion problems ⋮ Exact solution approach for a class of nonlinear bilevel knapsack problems ⋮ An exact penalty function approach for nonlinear integer programming problems ⋮ The indefinite zero-one quadratic problem ⋮ Lower bound improvement and forcing rule for quadratic binary programming ⋮ The generalized quadratic knapsack problem. A neuronal network approach ⋮ Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem ⋮ A logarithmic descent direction algorithm for the quadratic knapsack problem ⋮ Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure ⋮ Worst-case performance of approximation algorithms for tool management problems ⋮ Tightening concise linear reformulations of 0-1 cubic programs ⋮ A new upper bound for the 0-1 quadratic knapsack problem ⋮ Apportionments with minimum Gini index of disproportionality: a quadratic knapsack approach ⋮ An evolutionary heuristic for quadratic 0-1 programming ⋮ Linear programming for the \(0-1\) quadratic knapsack problem ⋮ Lagrangean methods for the 0-1 quadratic knapsack problem ⋮ Efficient solution approaches for a discrete multi-facility competitive interaction model ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ On the supermodular knapsack problem ⋮ Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem ⋮ Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem ⋮ AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS ⋮ Parametric convex quadratic relaxation of the quadratic knapsack problem ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals ⋮ Simulated annealing for the unconstrained quadratic pseudo-Boolean function ⋮ Unconstrained quadratic bivalent programming problem ⋮ A reduction technique for weighted grouping problems ⋮ Iterated responsive threshold search for the quadratic multiple knapsack problem ⋮ A dynamic programming algorithm for multiple-choice constraints ⋮ The polynomial robust 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 ⋮ One-pass heuristics for large-scale unconstrained binary quadratic 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 ⋮ Roof duality, complementation and persistency in quadratic 0–1 optimization ⋮ Packing under convex quadratic constraints ⋮ An unconstrained quadratic binary programming approach to the vertex coloring problem
This page was built for publication: Quadratic knapsack problems
