A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
From MaRDI portal
Publication:2693785
DOI10.1007/S11590-022-01891-9OpenAlexW4281492353MaRDI QIDQ2693785FDOQ2693785
Authors: Cheng Lu, Junhao Wu, Shaoze Li, Zhibin Deng 
Publication date: 24 March 2023
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-022-01891-9
Recommendations
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- A global continuation algorithm for solving binary quadratic programming problems
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
branch-and-bound algorithmglobal optimizationsymmetric structurelower bounding methodmixed binary quadratic program
Cites Work
- Demand allocation with latency cost functions
- Projected perspective reformulations with applications in design problems
- Covering a line segment with variable radius discs
- Orbital branching
- Reformulations in mathematical programming: automatic symmetry detection and exploitation
- Fundamental Domains for Integer Programs with Symmetries
- Stabilizer-based symmetry breaking constraints for mathematical programs
- Modified orbital branching for structured symmetry with an application to unit commitment
- Fast computation of global solutions to the single-period unit commitment problem
Cited In (1)
This page was built for publication: A fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2693785)
