default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAnnals of Operations Research, Volume 196
Volume 196, Number 1, July 2012
- Michael Andresen, Tanka Nath Dhamala:
New algorithms and complexity status of the reducibility problem of sequences in open shop scheduling minimizing the makespan. 1-26 - Sylvain Béal, Aymeric Lardon, Eric Rémila, Philippe Solal:
The average tree solution for multi-choice forest games. 27-51 - Andreas Bortfeldt, Sabine Jungmann:
A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. 53-71 - Edmund K. Burke
, Graham Kendall, Mustafa Misir, Ender Özcan:
Monte Carlo hyper-heuristics for examination timetabling. 73-90 - Edmund K. Burke, Jingpeng Li, Rong Qu:
A Pareto-based search methodology for multi-objective nurse scheduling. 91-109 - Héctor Cancela, Mohamed El Khadiri, Gerardo Rubino:
A new simulation method based on the RVR principle for the rare event network reliability problem. 111-136 - Felipe Caro, David Simchi-Levi:
Optimal static pricing for a tree network. 137-152 - Xiangfeng Chen, Anyu Wang:
Trade credit contract with limited liability in the supply chain with budget constraints. 153-165 - Ana Lisbeth Concho, Jose Emmanuel Ramirez-Marquez:
Optimal design of container inspection strategies considering multiple objectives via an evolutionary approach. 167-187 - Amir Danak, Shie Mannor:
Approximately optimal bidding policies for repeated first-price auctions. 189-199 - Pietro De Giovanni, Maria Roselli:
Overcoming the drawbacks of a revenue-sharing contract through a support program. 201-222 - Stephan Dempe, Alain B. Zemkoho:
Bilevel road pricing: theoretical analysis and optimality conditions. 223-240 - Gennadi Falin:
Stability of the multiserver queue with addressed retrials. 241-246 - Evgeny R. Gafarov, Alexander A. Lazarev, Frank Werner:
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one. 247-261 - Gebhard Geiger:
Multi-attribute non-expected utility. 263-292 - Yongming Hou:
Some inference results on random pure exchange economies. 293-309 - Natali Hritonenko, Yuri Yatsenko:
Fleet replacement under technological shocks. 311-331 - Rui Jiang, Michael Jong Kim, Viliam Makis:
A Bayesian model and numerical algorithm for CBM availability maximization. 333-348 - Wen-Hung Kuo:
Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect. 349-359 - Sascha Kurz:
On minimum sum representations for weighted voting games. 361-369 - Geng Lin, Wenxing Zhu:
A discrete dynamic convexized method for the max-cut problem. 371-390 - Andrey Lizyayev:
Stochastic dominance efficiency analysis of diversified portfolios: classification, comparison and refinements. 391-410 - Brian J. Lunday, Hanif D. Sherali:
Network interdiction to minimize the maximum probability of evasion with synergy between applied resources. 411-442 - Masashi Miyagawa:
Rectilinear distance to a facility in the presence of a square barrier. 443-458 - Nasim Nasrabadi, Akram Dehnokhalaji, Narsis Aftab Kiani, Pekka J. Korhonen, Jyrki Wallenius:
Resource allocation for performance improvement. 459-468 - Jomon Aliyas Paul, Govind Hariharan:
Location-allocation planning of stockpiles for effective disaster mitigation. 469-490 - Radoslaw Rudek:
Scheduling problems with position dependent job processing times: computational complexity results. 491-516 - Oguz Solyali, Haldun Süral:
The one-warehouse multi-retailer problem: reformulation, classification, and computational results. 517-541 - Mikhail Timonin:
Maximization of the Choquet integral over a convex set and its application to resource allocation problems. 543-579 - Heiko Vogel:
Solving market split problems with heuristical lattice reduction. 581-590 - Meihua Wang, Chengxian Xu, Fengmin Xu, Honggang Xue:
A mixed 0-1 LP for index tracking problem with CVaR risk constraints. 591-609 - Qinghua Wu, Jin-Kao Hao, Fred W. Glover:
Multi-neighborhood tabu search for the maximum weight clique problem. 611-634 - Tao Wu, Leyuan Shi, Jie Song:
An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times. 635-650 - Zahra Mashayekhi, Esmaile Khorram:
Convexity of chance constrained programming problems with respect to a new generalized concavity notion. 651-662 - Paola Festa, Panos M. Pardalos:
Efficient solutions for the far from most string problem. 663-682 - Sera Kahruman-Anderoglu, Elif Ulusal, Sergiy Butenko, Illya V. Hicks, Kathleen M. Diehl:
Scheduling the adjuvant endocrine therapy for early stage breast cancer. 683-705 - Hoda Parvin, Piyush Goel, Natarajan Gautam:
An analytic framework to develop policies for testing, prevention, and treatment of two-stage contagious diseases. 707-735 - Frank Pfeuffer, Michael Stiglmayr, Kathrin Klamroth:
Discrete and geometric Branch and Bound algorithms for medical image registration. 737-765 - Mustafa Y. Sir, Marina A. Epelman, Stephen M. Pollock:
Stochastic programming for off-line adaptive radiotherapy. 767-797 - Z. Caner Taskin, J. Cole Smith, H. Edwin Romeijn:
Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures. 799-818 - Ali T. Tuncel, Felisa Preciado, Ronald L. Rardin, Mark P. Langer, Jean-Philippe P. Richard:
Strong valid inequalities for fluence map optimization problem under dose-volume restrictions. 819-840
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-10-18 19: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:
