Остановите войну!
for scientists:
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 405 matches
- 2024
- 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) - Maocan Song, Lin Cheng, Bin Lu:
Solving the multi-compartment vehicle routing problem by an augmented Lagrangian relaxation method. Expert Syst. Appl. 237(Part B): 121511 (2024) - Kevin A. Bunn, José A. Ventura:
Reformulations to improve the Lagrangian relaxation approach for the capacitated multi-product dynamic lot sizing problem with batch ordering. Int. J. Prod. Res. 62(8): 2868-2887 (2024) - Carlos Victor Dantas Araújo, Cid Carvalho de Souza, Fábio Luiz Usberti:
Lagrangian relaxation for maximum service in multicast routing with QoS constraints. Int. Trans. Oper. Res. 31(1): 140-166 (2024) - Bingjie Liang, Wenqi Lu, Bin Ran:
Deploying Roadside Unit Efficiently in VANETs: A Multi-Objective Delay-Based Optimization Strategy Using Lagrangian Relaxation. IEEE Trans. Intell. Transp. Syst. 25(2): 1646-1660 (2024) - 2023
- Asya Atik, Leila Hajibabai:
Joint column generation and Lagrangian relaxation technique for incident respondent location and allocation. Comput. Aided Civ. Infrastructure Eng. 38(18): 2597-2613 (2023) - Maocan Song, Lin Cheng, Yibei Zhang:
Joint location optimization of charging stations and segments in the space-time-electricity network: An augmented Lagrangian relaxation and ADMM-based decomposition scheme. Comput. Ind. Eng. 183: 109517 (2023) - Zhenpeng Tang, Yanping Jiang, Feifei Yang:
An Efficient Lagrangian Relaxation Algorithm for the Shared Parking Problem. Comput. Ind. Eng. 176: 108860 (2023) - Sárka Stádlerová, Sanjay Dominik Jena, Peter Schütz:
Using Lagrangian relaxation to locate hydrogen production facilities under uncertain demand: a case study from Norway. Comput. Manag. Sci. 20(1): 10 (2023) - Lin Wang, Sirui Wang, Yeming Gong, Lu Peng:
Optimizing a multi-echelon location-inventory problem with joint replenishment: A Lipschitz ϵ-optimal approach using Lagrangian relaxation. Comput. Oper. Res. 151: 106128 (2023) - Maocan Song, Lin Cheng, Mingyang Du, Chao Sun, Jie Ma, Huimin Ge:
Charging station location problem for maximizing the space-time-electricity accessibility: A Lagrangian relaxation-based decomposition scheme. Expert Syst. Appl. 222: 119801 (2023) - Hwijae Son, Sung Woong Cho, Hyung Ju Hwang:
Enhanced physics-informed neural networks with Augmented Lagrangian relaxation method (AL-PINNs). Neurocomputing 548: 126424 (2023) - Zhaohui Li, Guohua Wan:
Batching and scheduling in a continuous-discrete hybrid flowshop: Lagrangian relaxation-based heuristic algorithms. Int. J. Prod. Res. 61(17): 5934-5955 (2023) - M. Hajibabaei, Javad Behnamian:
Fuzzy cleaner production in assembly flexible job-shop scheduling with machine breakdown and batch transportation: Lagrangian relaxation. J. Comb. Optim. 45(5): 112 (2023) - Xavier Cabezas, Sergio García:
A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order. J. Oper. Res. Soc. 74(11): 2391-2402 (2023) - Mingchang Ding, Jing-Mei Qiu, Ruiwen Shu:
Accuracy and Stability Analysis of the Semi-Lagrangian Method for Stiff Hyperbolic Relaxation Systems and Kinetic BGK Model. Multiscale Model. Simul. 21(1): 143-167 (2023) - Caroline Granfeldt, Ann-Brith Strömberg, Lisa Göransson:
A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution. OR Spectr. 45(4): 1263-1294 (2023) - Zhaojin Li, Haoxun Chen, Ya Liu, Kun Jin:
A Lagrangian Relaxation Heuristic for a Bi-Objective Multimodal Transportation Planning Problem. IEEE Trans. Intell. Transp. Syst. 24(1): 382-399 (2023) - 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) - Ludovica Adacher, Marta Flamini, Federica Pascucci:
A Lagrangian Relaxation Method for an Online Decentralized Assignment of Electric Vehicles to Charging Stations. IEEE Trans. Syst. Man Cybern. Syst. 53(9): 5568-5579 (2023) - Charlotte Ritter, Bismark Singh:
Statistical Performance of Subgradient Step-Size Update Rules in Lagrangian Relaxations of Chance-Constrained Optimization Models. OPTIMA 2023: 357-373 - Czeslaw Smutnicki, Jaroslaw Rudy, Radoslaw Idzikowski, Wojciech Bozejko:
Metaheuristic-Based Lagrangian Relaxation for Total Weighted Tardiness Minimization. PCC (2) 2023: 98-107 - Mikhail A. Bragin:
Lagrangian Relaxation for Mixed-Integer Linear Programming: Importance, Challenges, Recent Advancements, and Opportunities. CoRR abs/2301.00573 (2023) - Nikita Belyak, Fabricio Oliveira:
A novel dual-decomposition method based on p-Lagrangian relaxation. CoRR abs/2302.09872 (2023) - 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) - 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
- Junya Ikemoto, Toshimitsu Ushio:
Deep Reinforcement Learning Under Signal Temporal Logic Constraints Using Lagrangian Relaxation. IEEE Access 10: 114814-114828 (2022) - Yidong Wang, Rui Song, Shiwei He, Zilong Song, Jushang Chi:
Optimizing Train Routing Problem in a Multistation High-Speed Railway Hub by a Lagrangian Relaxation Approach. IEEE Access 10: 61992-62010 (2022) - Fatemeh Keshavarz-Ghorbani, Seyed Hamid Reza Pasandideh:
A Lagrangian relaxation algorithm for optimizing a bi-objective agro-supply chain model considering CO2 emissions. Ann. Oper. Res. 314(2): 497-527 (2022) - Hamed Soleimani, Prem Chhetri, Amir Mohammad Fathollahi Fard, S. M. J. Mirzapour Al-e-hashem, Shahrooz Shahparvari:
Sustainable closed-loop supply chain with energy efficiency: Lagrangian relaxation, reformulations and heuristics. Ann. Oper. Res. 318(1): 531-556 (2022)
skipping 375 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-05-10 19:49 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint