Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 191
Volume 191, Number 1, November 2011
- Philippe Galinier, Zied Boujbel, Michael Coutinho Fernandes:
An efficient memetic algorithm for the graph partitioning problem. 1-22 - Jörg Kalcsics
:
Improved complexity results for several multifacility location problems on trees. 23-36 - Shangyao Yan, Chun-Ying Chen:
An optimization model and a solution algorithm for the many-to-many car pooling problem. 37-71 - Konstantinos Skouri, Ioannis Konstantaras, Swapan Kumar Manna, K. S. Chaudhuri:
Inventory models with ramp type demand rate, time dependent deterioration rate, unit production cost and shortages. 73-95 - Manzhan Gu, Xiwen Lu:
Asymptotical optimality of WSEPT for stochastic online scheduling on uniform machines. 97-113 - Ismail Serdar Bakal, Nesim K. Erkip, Refik Güllü:
Value of supplier's capacity information in a two-echelon supply chain. 115-135 - Michel Grabisch:
Ensuring the boundedness of the core of games with restricted cooperation. 137-154 - Ji-Bo Wang, Ming-Zheng Wang:
Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects. 155-169 - George Steiner, Rui Zhang:
Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries. 171-181 - Sadegh Niroomand, Szabolcs Takács, Béla Vizvári:
To lay out or not to lay out? 183-192 - John Benedict C. Tajan, Appa Iyer Sivakumar, Stanley B. Gershwin:
Controlling job arrivals with processing time windows into Batch Processor Buffer. 193-218 - André Rossi, Alexis Aubry, Mireille Jacomino:
A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty. 219-249 - Evgeny V. Shchepin, Nodari Vakhania:
A note on the proof of the complexity of the little-preemptive open-shop problem. 251-253 - Marius Durea, Radu Strugariu:
Existence conditions for generalized vector variational inequalities. 255-262
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-07-20 21:18 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:
