default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikhail A. Bragin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j16]Mikhail A. Bragin
:
Survey on Lagrangian relaxation for MILP: importance, challenges, historical review, recent advancements, and opportunities. Ann. Oper. Res. 333(1): 29-45 (2024)- [j15]Tsung-Han Tsai, Bing Yan, Peter B. Luh, Haw Ching Yang, Mikhail A. Bragin, Fan-Tien Cheng:
Near-Optimal Scheduling for IC Packaging Operations Considering Processing-Time Variations and Factory Practices. IEEE Robotics Autom. Lett. 9(4): 3878-3885 (2024) - [j14]Anbang Liu, Peter B. Luh, Kailai Sun, Mikhail A. Bragin, Bing Yan:
Integrating Machine Learning and Mathematical Optimization for Job Shop Scheduling. IEEE Trans Autom. Sci. Eng. 21(3): 4829-4850 (2024) - [i12]Chaofan Lin, Peng Zhang, Mikhail A. Bragin, Yacov A. Shamash:
Reforming Quantum Microgrid Formation. CoRR abs/2406.05916 (2024) - 2023
- [j13]Jingtao Qin, Yuanqi Gao, Mikhail A. Bragin, Nanpeng Yu:
An Optimization Method-Assisted Ensemble Deep Reinforcement Learning Algorithm to Solve Unit Commitment Problems. IEEE Access 11: 100125-100136 (2023) - [j12]Shanglin Zhou, Mikhail A. Bragin, Deniz Gurevin, Lynn Pepin, Fei Miao, Caiwen Ding:
Surrogate Lagrangian Relaxation: A Path to Retrain-Free Deep Neural Network Pruning. ACM Trans. Design Autom. Electr. Syst. 28(6): 102:1-102:19 (2023) - [c6]Bingbing Li, Zigeng Wang, Shaoyi Huang, Mikhail A. Bragin, Ji Li, Caiwen Ding:
Towards Lossless Head Pruning through Automatic Peer Distillation for Language Models. IJCAI 2023: 5113-5121 - [c5]Zigeng Wang, Bingbing Li, Xia Xiao, Tianyun Zhang, Mikhail A. Bragin, Bing Yan, Caiwen Ding, Sanguthevar Rajasekaran:
Automatic Subnetwork Search Through Dynamic Differentiable Neuron Pruning. ISQED 2023: 1-6 - [i11]Mikhail A. Bragin:
Lagrangian Relaxation for Mixed-Integer Linear Programming: Importance, Challenges, Recent Advancements, and Opportunities. CoRR abs/2301.00573 (2023) - [i10]Mikhail A. Bragin, Zuzhao Ye, Nanpeng Yu:
Toward Efficient Transportation Electrification of Heavy-Duty Trucks: Joint Scheduling of Truck Routing and Charging. CoRR abs/2302.00240 (2023) - [i9]Shanglin Zhou, Mikhail A. Bragin, Lynn Pepin, Deniz Gurevin, Fei Miao, Caiwen Ding:
Surrogate Lagrangian Relaxation: A Path To Retrain-free Deep Neural Network Pruning. CoRR abs/2304.04120 (2023) - [i8]Mikhail A. Bragin, Farhan Hyder, Bing Yan, Peter B. Luh, Jinye Zhao, Feng Zhao, Dane A. Schiro, Tongxin Zheng:
Novel Quality Measure and Efficient Resolution of Convex Hull Pricing for Unit Commitment. CoRR abs/2304.07990 (2023) - [i7]Osten Anderson, Nanpeng Yu, Mikhail A. Bragin:
Optimize Deep Decarbonization Pathways in California with Power System Planning Using Surrogate Level-based Lagrangian Relaxation. CoRR abs/2309.07202 (2023) - 2022
- [j11]Dmitry Zhdanov, Sudip Bhattacharjee, Mikhail A. Bragin:
Incorporating FAT and privacy aware AI modeling approaches into business decision making frameworks. Decis. Support Syst. 155: 113715 (2022) - [j10]Shanglin Zhou, Xiaowei Xu, Jun Bai, Mikhail A. Bragin:
Combining multi-view ensemble and surrogate lagrangian relaxation for real-time 3D biomedical image segmentation on the edge. Neurocomputing 512: 466-481 (2022) - [j9]Bing Yan, Mikhail A. Bragin, Peter B. Luh:
An Innovative Formulation Tightening Approach for Job-Shop Scheduling. IEEE Trans Autom. Sci. Eng. 19(3): 2526-2539 (2022) - [i6]Mikhail A. Bragin:
Surrogate "Level-Based" Lagrangian Relaxation for Mixed-Integer Linear Programming. CoRR abs/2203.04514 (2022) - [i5]Jingtao Qin, Yuanqi Gao, Mikhail A. Bragin, Nanpeng Yu:
An Optimization Method-Assisted Ensemble Deep Reinforcement Learning Algorithm to Solve Unit Commitment Problems. CoRR abs/2206.04249 (2022) - [i4]Mikhail A. Bragin, Matthew E. Wilhelm, Matthew D. Stuber:
Toward Agile and Robust Supply Chains: A Lesson from Stochastic Job-Shop Scheduling. CoRR abs/2206.09326 (2022) - 2021
- [j8]Anbang Liu, Peter B. Luh, Bing Yan, Mikhail A. Bragin:
A Novel Integer Linear Programming Formulation for Job-Shop Scheduling Problems. IEEE Robotics Autom. Lett. 6(3): 5937-5944 (2021) - [j7]Mikhail A. Bragin, Bing Yan, Peter B. Luh:
Distributed and Asynchronous Coordination of a Mixed-Integer Linear System via Surrogate Lagrangian Relaxation. IEEE Trans Autom. Sci. Eng. 18(3): 1191-1205 (2021) - [c4]Deniz Gurevin, Mikhail A. Bragin, Caiwen Ding, Shanglin Zhou, Lynn Pepin, Bingbing Li, Fei Miao:
Enabling Retrain-free Deep Neural Network Pruning Using Surrogate Lagrangian Relaxation. IJCAI 2021: 2497-2504 - [i3]Mikhail A. Bragin, Yury Dvorkin:
TSO-DSO Operational Planning Coordination through Surrogate Lagrangian Relaxation. CoRR abs/2101.09877 (2021) - [i2]Nima Nikmehr, Mikhail A. Bragin, Peter B. Luh, Peng Zhang:
Distributed and Asynchronous Operational Optimization of Networked Microgrids. CoRR abs/2102.03496 (2021) - 2020
- [j6]An-Bang Liu, Peter B. Luh, Mikhail A. Bragin, Bing Yan:
Ordinal-Optimization Concept Enabled Decomposition and Coordination of Mixed-Integer Linear Programming Problems. IEEE Robotics Autom. Lett. 5(4): 5051-5058 (2020) - [c3]Bing Yan, Mikhail A. Bragin, Peter B. Luh:
Tightened Formulation and Resolution of Energy-Efficient Job-Shop Scheduling. CASE 2020: 741-746 - [i1]Deniz Gurevin, Shanglin Zhou, Lynn Pepin, Bingbing Li, Mikhail A. Bragin, Caiwen Ding, Fei Miao:
A Surrogate Lagrangian Relaxation-based Model Compression for Deep Neural Networks. CoRR abs/2012.10079 (2020)
2010 – 2019
- 2019
- [j5]Mikhail A. Bragin, Peter B. Luh, Bing Yan, Xiaorong Sun:
A Scalable Solution Methodology for Mixed-Integer Linear Programming Problems Arising in Automation. IEEE Trans Autom. Sci. Eng. 16(2): 531-541 (2019) - 2018
- [j4]Bing Yan, Mikhail A. Bragin, Peter B. Luh:
Novel Formulation and Resolution of Job-Shop Scheduling Problems. IEEE Robotics Autom. Lett. 3(4): 3387-3393 (2018) - [c2]Wenfeng Wan, Yan Li, Bing Yan, Mikhail A. Bragin, Jason Philhower, Peng Zhang, Peter B. Luh, Guy Warner:
Active Fault Management for Microgrids. IECON 2018: 3815-3820 - 2017
- [j3]Bing Yan, Haipei Fan, Peter B. Luh, Khosrow Moslehi, Xiaoming Feng, Chien Ning Yu, Mikhail A. Bragin, Yaowen Yu:
Grid integration of wind generation considering remote wind farms: hybrid markovian and interval unit commitment. IEEE CAA J. Autom. Sinica 4(2): 205-215 (2017) - 2016
- [j2]Mikhail A. Bragin, Peter B. Luh, Joseph H. Yan, Gary A. Stern:
An efficient approach for solving mixed-integer programming problems under the monotonic condition. J. Control. Decis. 3(1): 44-67 (2016) - 2015
- [j1]Mikhail A. Bragin, Peter B. Luh, Joseph H. Yan, Nanpeng Yu, Gary A. Stern:
Convergence of the Surrogate Lagrangian Relaxation Method. J. Optim. Theory Appl. 164(1): 173-201 (2015) - 2014
- [c1]Bing Yan, Peter B. Luh, Mikhail A. Bragin, Chen Song, Chenhui Dong, Zhongxue Gan:
Energy-efficient building clusters. CASE 2014: 966-971
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
