Modified branch‐and‐bound algorithm for unravelling optimal PMU placement problem for power grid observability: : A comparative analysis
Abstract
References
Recommendations
Solving the multistage PMU placement problem by integer programming and equivalent network design model
Recently, phasor measurement units (PMUs) are becoming widely used to measure the electrical waves on a power grid to determine the health of the system. Because of high expense for PMUs, it is important to place minimized number of PMUs on power grids ...
A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times
Although the textbook Dantzig-Wolfe decomposition reformulation for the capacitated lot-sizing problem, as already proposed by Manne [Manne, A. S. 1958. Programming of economic lot sizes. Management Sci.4(2) 115--135], provides a strong lower bound, it ...
Branch-And-Price: Column Generation for Solving Huge Integer Programs
We discuss formulations of integer programs with a huge number of variables and their solution by column generation methods, i.e., implicit pricing of nonbasic variables to generate new columns or to prove LP optimality at a node of the branch-and-bound ...
Comments
Information & Contributors
Information
Published In
Publisher
John Wiley & Sons, Inc.
United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in