Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 41
Volume 41, January 2014
- Daniele Manerba
, Renata Mansini:
An effective matheuristic for the capacitated total quantity discount problem. 1-11 - Renaud Masson, Fabien Lehuédé, Olivier Péton:
The Dial-A-Ride Problem with Transfers. 12-23 - Federico Della Croce, Michele Garraffa:
The Selective Fixing Algorithm for the closest string problem. 24-30 - Vahid Kayvanfar, G. M. Komaki, Amin Aalaei, Mostafa Zandieh:
Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. 31-43 - Mercedes Landete, Alfredo Marín:
Looking for edge-equitable spanning trees. 44-52 - Javad Sadeghi, Saeid Sadeghi, Seyed Taghi Akhavan Niaki:
A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: An NSGA-II with tuned parameters. 53-64 - Laura Silva de Assis, Paulo Morelato França, Fábio Luiz Usberti:
A redistricting problem applied to meter reading in power distribution networks. 65-75 - M. Angélica Salazar-Aguilar, André Langevin, Gilbert Laporte:
The multi-district team orienteering problem. 76-82 - Rachida Abounacer, Monia Rekik, Jacques Renaud:
An exact solution approach for multi-objective location-transportation problem for disaster response. 83-93 - Keramat Hasani, Svetlana A. Kravchenko, Frank Werner:
Block models for scheduling jobs on two parallel machines with a single server. 94-97 - Jong Soo Kim, Sung Il Park, Ki Young Shin:
A quantity flexibility contract model for a system with heterogeneous suppliers. 98-108 - Kenneth R. Baker:
Setting optimal due dates in a basic safe-scheduling model. 109-114 - Baruch Mor, Gur Mosheiov:
Batch scheduling of identical jobs with controllable processing times. 115-124 - Guojiang Xiong, Dongyuan Shi, Xianzhong Duan:
Enhancing the performance of biogeography-based optimization using polyphyletic migration operator and orthogonal learning. 125-139 - Shuaian Wang, Qiang Meng:
Liner shipping network design with deadlines. 140-149 - Robert L. Burdett, Erhan Kozan:
Determining operations affected by delay in predictive train timetables. 150-166 - Nabila Azi, Michel Gendreau, Jean-Yves Potvin:
An adaptive large neighborhood search for a vehicle routing problem with multiple routes. 167-173 - Jenny Nossack, Erwin Pesch:
A branch-and-bound algorithm for the acyclic partitioning problem. 174-184 - José Fernández, Saïd Salhi, Boglárka G.-Tóth:
Location equilibria for a continuous competitive facility location problem under delivered pricing. 185-195 - Julien Michallet, Christian Prins, Lionel Amodeo, Farouk Yalaoui, Grégoire Vitry:
Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. 196-207 - Tobias Buer, Herbert Kopfer:
A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction. 208-220
- Georgios K. D. Saharidis, Antonio J. Conejo, George Kozanidis:
Preface. 221-222 - Belmiro P. M. Duarte, Angelos Tsoukalas:
Solving quality control problems with an algorithm for minimax programs with coupled constraints. 223-230 - Le Thi Hoai An, Duc Manh Nguyen, Tao Pham Dinh:
A DC programming approach for planning a multisensor multizone search for a target. 231-239 - Enrique F. Castillo, José María Menéndez, Santos Sánchez-Cambronero, Aida Calvino, José María Sarabia:
A hierarchical optimization problem: Estimating traffic flow using Gamma random variables in a Bayesian context. 240-251 - Guangmin Wang, Ziyou Gao, Meng Xu, Huijun Sun:
Models and a relaxation algorithm for continuous network design problem with a tradable credit scheme and equity constraints. 252-261 - Eusebio Angulo, Enrique F. Castillo, Ricardo García-Ródenas, Jesús Sánchez-Vizcaíno:
A continuous bi-level model for the expansion of highway networks. 262-276 - Stephan Dempe, Susanne Franke:
Solution algorithm for an optimistic linear Stackelberg problem. 277-281 - Natalia Alguacil, Andrés Delgadillo, José Manuel Arroyo:
A trilevel programming approach for electric grid defense planning. 282-290 - François Gilbert, Patrice Marcotte, Gilles Savard:
Logit network pricing. 291-298 - Hua-Ming Song, Hui Yang, Alain Bensoussan, Ding Zhang:
Optimal decision making in multi-product dual sourcing procurement with demand forecast updating. 299-308 - Pan Xu, Lizhi Wang:
An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. 309-318 - Ross Baldick, Dhiman Chatterjee:
Coordinated dispatch of regional transmission organizations: Theory and example. 319-332 - Sonja Steffensen, Micha Bittner:
Relaxation approach for equilibrium problems with equilibrium constraints. 333-345 - Deniz Aksen, Sema Sengül Akca, Necati Aras:
A bilevel partial interdiction problem with capacitated facilities and demand outsourcing. 346-358 - Dali Zhang, Gui-Hua Lin:
Bilevel direct search method for leader-follower problems and application in health insurance. 359-373 - Ankur Sinha, Pekka Malo, Anton Frantsev, Kalyanmoy Deb:
Finding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm. 374-385 - Mujahid N. Syed, Pando G. Georgiev, Panos M. Pardalos:
A hierarchical approach for sparse source Blind Signal Separation problem. 386-398 - Suh-Wen Chiou:
Optimization of robust area traffic control with equilibrium flow under demand uncertainty. 399-411 - Mihalis M. Golias, Isabel Portal, Dinçer Konur, Evangelos Kaisar, Georgios Kolomvos:
Robust berth scheduling at marine container terminals via hierarchical optimization. 412-422
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-19 20:13 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:
