An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
From MaRDI portal
Publication:6166655
DOI10.1007/s10589-023-00488-xOpenAlexW4367679639MaRDI QIDQ6166655
No author found.
Publication date: 3 August 2023
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-023-00488-x
branch-and-bound algorithmsymmetric structureaggregate functionindefinite separable quadratic knapsack programs
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Unnamed Item
- Unnamed Item
- An efficient global algorithm for a class of indefinite separable quadratic programs
- Orbitopal fixing
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Approximation algorithms for indefinite quadratic programming
- A Newton's method for the continuous quadratic knapsack problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Packing and partitioning orbitopes
- Constrained global optimization: algorithms and applications
- Local minima for indefinite quadratic knapsack problems
- Globally solving nonconvex quadratic programming problems via completely positive programming
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems
- On a primal-dual Newton proximal method for convex quadratic programs
- Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem
- On the solution of concave knapsack problems
- Modified orbital branching for structured symmetry with an application to unit commitment
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- Conic approximation to quadratic optimization with linear complementarity constraints
- Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- Multipoint methods for separable nonlinear networks
- Fundamental Domains for Integer Programs with Symmetries
- Variational Analysis
- Introduction to global optimization.
