Polyhedral results, branch-and-cut and Lagrangian relaxation algorithms for the adjacent only quadratic minimum spanning tree problem
Sign Up to like & getrecommendations! Published in 2018 at "Networks"
DOI: 10.1002/net.21787
Abstract: Given a complete and undirected graph G, the adjacent only quadratic minimum spanning tree problem (AQMSTP) consists of finding a spanning tree that minimizes a quadratic function of its adjacent edges. The strongest AQMSTP linear… read more here.
Keywords: branch cut; lagrangian relaxation; adjacent quadratic; problem ... See more keywords
A novel Lagrangian relaxation level approach for scheduling steelmaking-refining-continuous casting production
Sign Up to like & getrecommendations! Published in 2017 at "Journal of Central South University"
DOI: 10.1007/s11771-017-3449-1
Abstract: A Lagrangian relaxation (LR) approach was presented which is with machine capacity relaxation and operation precedence relaxation for solving a flexible job shop (FJS) scheduling problem from the steelmaking-refining-continuous casting process. Unlike the full optimization… read more here.
Keywords: refining continuous; relaxation; level; lagrangian relaxation ... See more keywords
Two Approaches for Timing-Driven Placement by Lagrangian Relaxation
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"
DOI: 10.1109/tcad.2017.2697947
Abstract: In this paper, we propose Lagrangian relaxation (LR)-based algorithms to optimize both circuit performance and total wirelength at the global placement stage. We introduce a general timing-driven global placement problem formulation that is applicable to… read more here.
Keywords: wirelength; lagrangian relaxation; timing driven; placement ... See more keywords
Parallel Augmented Lagrangian Relaxation for Dynamic Economic Dispatch Using Diagonal Quadratic Approximation Method
Sign Up to like & getrecommendations! Published in 2017 at "IEEE Transactions on Power Systems"
DOI: 10.1109/tpwrs.2016.2576465
Abstract: Dynamic economic dispatch (DED) over multiple time periods is a large-scale coupled spatial-temporal optimization problem. Therefore, the Lagrangian relaxation method has been widely used to split the large-scale optimization problem with coupled structure into several… read more here.
Keywords: relaxation; method; lagrangian relaxation; economic dispatch ... See more keywords
Lagrangian Relaxation With Incremental Proximal Method for Economic Dispatch With Large Numbers of Wind Power Scenarios
Sign Up to like & getrecommendations! Published in 2019 at "IEEE Transactions on Power Systems"
DOI: 10.1109/tpwrs.2019.2891227
Abstract: Scenario-based approaches have been widely employed in stochastic economic dispatch with wind power integration. However, due to computational limitations, the number of wind power scenarios usually need to be reduced to a small subset of… read more here.
Keywords: economic dispatch; power; proximal method; dispatch ... See more keywords