A dictionary‐based graph‐cut algorithm for MRI reconstruction
Sign Up to like & getrecommendations! Published in 2020 at "NMR in Biomedicine"
DOI: 10.1002/nbm.4344
Abstract: Compressive sensing (CS)‐based image reconstruction methods have proposed random undersampling schemes that produce incoherent, noise‐like aliasing artifacts, which are easier to remove. The denoising process is critically assisted by imposing sparsity‐enforcing priors. Sparsity is known… read more here.
Keywords: reconstruction; based graph; graph cut; cut algorithm ... See more keywords
A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
Sign Up to like & getrecommendations! Published in 2020 at "Computational Optimization and Applications"
DOI: 10.1007/s10589-019-00153-2
Abstract: We consider a cutting-plane algorithm for solving mixed-integer semidefinite optimization (MISDO) problems. In this algorithm, the positive semidefinite (psd) constraint is relaxed, and the resultant mixed-integer linear optimization problem is solved repeatedly, imposing at each… read more here.
Keywords: optimization; mixed integer; branch cut; cut algorithm ... See more keywords
A branch and cut algorithm for the capacitated star–star telecommunication network problem
Sign Up to like & getrecommendations! Published in 2019 at "Optimization Letters"
DOI: 10.1007/s11590-018-1282-6
Abstract: In this study, a branch and cut algorithm is generated for a telecommunication network problem with bi-hierarchical star–star design and fixed identical concentrator capacities. The problem aims to find out how many and on which… read more here.
Keywords: telecommunication network; problem; cut algorithm; network problem ... See more keywords
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
Sign Up to like & getrecommendations! Published in 2018 at "EURO Journal on Computational Optimization"
DOI: 10.1007/s13675-017-0091-5
Abstract: In this paper, we present a state-of-the-art branch-and-cut (B&C) algorithm for the multicommodity capacitated fixed charge network design problem (MCND). This algorithm combines bounding and branching procedures inspired by the latest developments in mixed-integer programming… read more here.
Keywords: branch cut; multicommodity capacitated; fixed charge; cut algorithm ... See more keywords