Quadratic knapsack problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Efficient solution approaches for a discrete multi-facility competitive interaction model
- A quadratic integer program for the location of interacting hub facilities
- Linear programming for the \(0-1\) quadratic knapsack problem
- Lagrangean methods for the 0-1 quadratic knapsack problem
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- A column generation approach to job grouping for flexible manufacturing systems
- On the magnetisation of the ground states in two dimensional Ising spin glasses
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- The nonlinear knapsack problem - algorithms and applications
- 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
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- A computational study on the quadratic knapsack problem with multiple constraints
- Reoptimization in Lagrangian methods for the 0-1 quadratic knapsack problem
- A new upper bound for the 0-1 quadratic knapsack problem
- An evolutionary heuristic for quadratic 0-1 programming
- On the supermodular knapsack problem
- A reduction technique for weighted grouping problems
- The quadratic 0-1 knapsack problem with series-parallel support
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems
- LAD models, trees, and an analog of the fundamental theorem of arithmetic
- Exact solution approach for a class of nonlinear bilevel knapsack problems
- Polynomial-size formulations and relaxations for the quadratic multiple knapsack problem
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- The polynomial robust knapsack problem
- Packing under convex quadratic constraints
- Knapsack problems with dependencies through non-additive measures and Choquet integral
- On the rectangular knapsack problem
- Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering
- Dual mean field annealing scheme for binary optimization under linear constraints
- 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
- A logarithmic descent direction algorithm for the quadratic knapsack problem
- Parametric convex quadratic relaxation of the quadratic knapsack problem
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments
- Iterated responsive threshold search for the quadratic multiple knapsack problem
- Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs
- A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems
- Quadratic bottleneck knapsack problems
- A survey on the continuous nonlinear resource allocation problem
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
- Upper bounds and exact algorithms for \(p\)-dispersion problems
- Lower bound improvement and forcing rule for quadratic binary programming
- The generalized quadratic knapsack problem. A neuronal network approach
- An approximate dynamic programming approach to convex quadratic knapsack problems
- 0-1 quadratic knapsack problem solved with VNS algorithm
- 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
- A cut-and-branch algorithm for the quadratic knapsack problem
- f-flip strategies for unconstrained binary quadratic programming
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Tightening concise linear reformulations of 0-1 cubic programs
- An improved convex 0-1 quadratic program reformulation for chance-constrained quadratic knapsack problems
- A note on semidefinite relaxation for 0-1 quadratic knapsack problems
- A dynamic programming heuristic for the quadratic knapsack problem
- Lower planes for the network design problem
- An ejection chain approach for the quadratic multiple knapsack problem
- Asymptotic behavior of the quadratic knapsack problem
- Nonlinear integer programming for various forms of constraints
- Generalized quadratic multiple knapsack problem and two solution approaches
- Concise RLT forms of binary programs: a computational study of the quadratic knapsack problem
- Roof duality, complementation and persistency in quadratic 0–1 optimization
- Models and methods of solution of quadratic integer programming problems
- scientific article; zbMATH DE number 1271323 (Why is no real title available?)
- Worst-case performance of approximation algorithms for tool management problems
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- Two-stage quadratic integer programs with stochastic right-hand sides
- Bounds for random binary quadratic programs
- Solving Quadratic Programming by Cutting Planes
- Solving unconstrained binary quadratic programming problem by global equilibrium search
- Optimization methods for mixed integer weakly concave programming problems
- Packing under convex quadratic constraints
- An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating
- Aspects of stability for multicriteria quadratic problems of Boolean programming
- Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning
- Quadratic bottleneck problems
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- An exact penalty function approach for nonlinear integer programming problems
- The indefinite zero-one quadratic problem
- scientific article; zbMATH DE number 7656032 (Why is no real title available?)
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Lagrangian heuristics for the quadratic knapsack problem
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem
- A reformulation technique to solve polynomial optimization problems with separable objective functions of bounded integer variables
- Diversification-driven tabu search for unconstrained binary quadratic problems
- A general purpose exact solution method for mixed integer concave minimization problems
- A hybrid metaheuristic approach to solving the UBQP problem
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- Global optimality conditions and optimization methods for quadratic knapsack problems
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Tight upper and lower bounds for the quadratic knapsack problem through binary decision diagrams
- On reduction of duality gap in quadratic knapsack problems
- The quadratic knapsack problem
This page was built for publication: Quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3912370)
