Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 210
Volume 210, Number 1, November 2013
- Georgios K. D. Saharidis, Marianthi G. Ierapetritou, Christodoulos A. Floudas:
Editorial. 1-4 - Yohan Shim, Marte Fodstad, Steven A. Gabriel, Asgeir Tomasgard
:
A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints. 5-31 - Joe Naoum-Sawaya, Samir Elhedhli:
An interior-point Benders based branch-and-cut algorithm for mixed integer programs. 33-55 - Hanif D. Sherali, Brian J. Lunday:
On generating maximal nondominated Benders cuts. 57-72 - Rafael Lazimy:
Interactive Polyhedral Outer Approximation (IPOA) strategy for general multiobjective optimization problems. 73-99 - Georgios K. D. Saharidis, Marianthi G. Ierapetritou:
Speed-up Benders decomposition using maximum density cut (MDC) generation. 101-123 - Nader Azad, Georgios K. D. Saharidis, Hamid Davoudpour, Hooman Malekly, Seyed Alireza Yektamaram:
Strategies for protecting supply chain networks against facility and transportation disruptions: an improved Benders decomposition approach. 125-163 - Lixin Tang, Wei Jiang, Georgios K. D. Saharidis:
An improved Benders decomposition algorithm for the logistics facility location problem with capacity expansions. 165-190 - Fengqi You, Ignacio E. Grossmann:
Multicut Benders decomposition algorithm for process supply chain planning under uncertainty. 191-211 - Hanif D. Sherali, Ki-Hwan Bae, Mohamed Haouari:
A benders decomposition approach for an integrated airline schedule design and fleet assignment problem with flight retiming, schedule balance, and demand recapture. 213-244 - Elvin Coban, John N. Hooker:
Single-facility scheduling by logic-based Benders decomposition. 245-272 - Roberto Mínguez, Antonio J. Conejo, Enrique F. Castillo:
Optimal engineering design via Benders' decomposition. 273-293 - Ashkan Fakhri, Mehdi Ghatee:
Solution of preemptive multi-objective network design problems applying Benders decomposition method. 295-307 - Enrique F. Castillo, Roberto Mínguez, Antonio J. Conejo, Beatriz Pérez-Sánchez, Oscar Fontenla-Romero:
Estimating the parameters of a fatigue model using Benders' decomposition. 309-331 - Siqian Shen, J. Cole Smith:
A decomposition approach for solving a broadcast domination network design problem. 333-360 - Jennifer Van Dinter, Steffen Rebennack, Josef Kallrath, Paul Denholm, Alexandra M. Newman:
The unit commitment model with concave emissions costs: a hybrid Benders' Decomposition with nonconvex master problems. 361-386 - Qipeng P. Zheng, Jianhui Wang, Panos M. Pardalos, Yongpei Guan:
A decomposition approach to the two-stage stochastic unit commitment problem. 387-410 - Ludwig Kuznia, Bo Zeng, Grisselle Centeno, Zhixin Miao:
Stochastic optimization for power system configuration with renewable energy in remote areas. 411-432
a service of 
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.
last updated on 2024-04-25 05:28 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:
