Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEURO Journal on Computational Optimization, Volume 6
Volume 6, Number 1, March 2018
- Sune Lauth Gadegaard
, Andreas Klose, Lars Relund Nielsen:
An improved cut-and-solve algorithm for the single-source capacitated facility location problem. 1-27 - Anjulika Gupta, Prabha Sharma, Hemant Salwan:
A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights. 29-54 - Dimitri J. Papageorgiou, Francisco Trespalacios:
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming. 55-83 - Gizem Ozbaygin, Oya Ekin Karasan, Hande Yaman:
New exact solution approaches for the split delivery vehicle routing problem. 85-115
Volume 6, Number 2, June 2018
- Christian Artigues, Nicolas Jozefowiez, Boadu Mensah Sarpong:
Column generation algorithms for bi-objective combinatorial optimization problems with a min-max objective. 117-142 - Mervat Chouman, Teodor Gabriel Crainic, Bernard Gendron:
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design. 143-184 - Abdelouahab Zaghrouti, Issmail El Hallaoui, François Soumis:
Improved integral simplex using decomposition for the set partitioning problem. 185-206
Volume 6, Number 3, September 2018
- Arie M. C. A. Koster, Michael Poss:
Special issue on: robust combinatorial optimization. 207-209 - Christoph Buchheim, Jannis Kurtz:
Robust combinatorial optimization under convex and discrete cost uncertainty. 211-238 - Annette M. C. Ficker, Frits C. R. Spieksma, Gerhard J. Woeginger:
Robust balanced optimization. 239-266 - Virginie Gabrel, Cécile Murat, Aurélie Thiele:
Portfolio optimization with pw-robustness. 267-290 - Idir Hamaz, Laurent Houssin, Sonia Cafieri:
A robust basic cyclic scheduling problem. 291-313
Volume 6, Number 4, December 2018
- Jannis Kurtz:
Robust combinatorial optimization under budgeted-ellipsoidal uncertainty. 315-337 - Christina Büsing, Sigrid Knust, Xuan Thanh Le:
Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. 339-365 - Kamyar Kargar, Halil Ibrahim Bayrak, Mustafa Ç. Pinar:
Robust bilateral trade with discrete types. 367-393 - Walid Ben-Ameur, Adam Ouorou, Guanglei Wang, Mateusz Zotkiewicz:
Multipolar robust optimization. 395-434
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-18 21:11 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:
