Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 51
Volume 51, November 2014
- Dongsheng Xu, Cai Wen Zhang, Zhaowei Miao, Raymond K. Cheung:
A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals. 1-10 - Tadeusz Sawik
:
Optimization of cost and service level in the presence of supply chain disruption risks: Single vs. multiple sourcing. 11-20 - Fatih Kiliç, Mustafa Gök:
A demand based route generation algorithm for public transit network design. 21-29 - Heinrich Kuhn, Thomas Liske:
An exact algorithm for solving the economic lot and supply scheduling problem using a power-of-two policy. 30-40 - Chang-Chun Lin, Yen-I Chiang, Shih-Wei Lin:
Efficient model and heuristic for the intermodal terminal location problem. 41-51 - Gigyoung Park, Youngho Lee, Junghee Han:
A two-level location-allocation problem in designing local access fiber optic networks. 52-63 - Subhash C. Sarin, Hanif D. Sherali, Jason D. Judd, Pei-Fang Jennifer Tsai:
Multiple asymmetric traveling salesmen problem with and without precedence constraints: Performance comparison of alternative formulations. 64-89 - Bert Réveil, Dieter Claeys, Tom Maertens, Joris Walraevens, Herwig Bruneel:
Impact of class clustering in a multiclass FCFS queue with order-dependent service times. 90-98 - Tse-Chiu Wong, Mai Xu, Kwai-Sang Chin:
A two-stage heuristic approach for nurse scheduling problem: A case study in an emergency department. 99-110 - Mohand Lounes Bentaha, Olga Battaïa, Alexandre Dolgui:
A sample average approximation method for disassembly line balancing problem under uncertainty. 111-122 - Abraham Duarte, Manuel Laguna, Rafael Martí, Jesús Sánchez-Oro:
Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem. 123-129 - Stephen J. Maher, Guy Desaulniers, François Soumis:
Recoverable robust single day aircraft maintenance routing problem. 130-145 - Luis Cadarso, Ángel Marín:
Improving robustness of rolling stock circulations in rapid transit networks. 146-159 - Rudolf Vetschera, Paula Sarabando, Luis C. Dias:
Levels of incomplete information in group decision models - A comprehensive simulation study. 160-171 - Shih-Wei Lin, Kuo-Ching Ying:
ABC-based manufacturing scheduling for unrelated parallel machines with machine-dependent and job sequence-dependent setup times. 172-181 - Ketan Date, Suryaansh Makked, Rakesh Nagi:
Dominance rules for the optimal placement of a finite-size facility in an existing layout. 182-189 - Franco Mascia, Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Thomas Stützle:
Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. 190-199 - Ali Allahverdi, Harun Aydilek, Asiye Aydilek:
Single machine scheduling problem with interval processing times to minimize mean weighted completion time. 200-207 - Wen-Chiung Lee, Jen-Ya Wang:
A scheduling problem with three competing agents. 208-217 - Fatih Kocatürk, Özgür Özpeynirci:
Variable neighborhood search for the pharmacy duty scheduling problem. 218-226 - Benoît Dupont de Dinechin, Alix Munier Kordon:
Converging to periodic schedules for cyclic scheduling problems with resources and deadlines. 227-236 - Cesar Beltran-Royo, Laureano F. Escudero, Juan F. Monge, R. E. Rodriguez-Ravines:
An effective heuristic for multistage linear programming with a stochastic right-hand side. 237-250 - Peihai Liu, Xiwen Lu:
A best possible on-line algorithm for two-machine flow shop scheduling to minimize makespan. 251-256 - Diego Cattaruzza, Nabil Absi, Dominique Feillet, Daniele Vigo:
An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. 257-267 - Enrico Angelelli, Nicola Bianchessi, Carlo Filippi:
Optimal interval scheduling with a resource constraint. 268-281 - Zhaoyang Zhou, Chu Min Li, Chong Huang, Ruchu Xu:
An exact algorithm with learning for the graph coloring problem. 282-301 - Reza Maihami, Behrooz Karimi:
Optimizing the pricing and replenishment policy for non-instantaneous deteriorating items with stochastic demand and promotional efforts. 302-312 - Dieter Claeys, Joris Walraevens, Bart Steyaert, Herwig Bruneel:
Applicability of a static model in a dynamic context in group-screening decision making. 313-322 - Anis Kooli, Mehdi Serairi:
A mixed integer programming approach for the single machine problem with unequal release dates. 323-330 - Adam N. Letchford, Saeideh D. Nasiri, Amar Oukil:
Pricing routines for vehicle routing with time windows on road networks. 331-337 - Chi-Kong Ng, Duan Li:
Test problem generator for unconstrained global optimization. 338-349 - Li Sun, Gail W. DePuy, Gerald W. Evans:
Multi-objective optimization models for patient allocation during a pandemic influenza outbreak. 350-359
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-06-19 21:50 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:
