default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 124
Volume 124, December 2020
- Ying Chen, Feng Liu
, Jay M. Rosenberger, Victoria C. P. Chen, Asama Kulvanitchaiyanunt, Yuan Zhou:
Efficient approximate dynamic programming based on design and analysis of computer experiments for infinite-horizon optimization. 105032 - Mohammad Abdul Hoque, Arijit Bhattacharya:
A manufacturer-buyers integrated inventory model with generic distribution of lead times to deliver equal and/or unequal batch sizes. 105047 - Ruilin Ouyang, Chun-An Chou:
Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data. 105049 - Chi-Shiuan Lin, Pei-Yi Li, Jun-Min Wei, Muh-Cherng Wu:
Integration of process planning and scheduling for distributed flexible job shops. 105053 - Paola Cappanera, Cristina Requejo, Maria Grazia Scutellà:
Temporal constraints and device management for the Skill VRP: Mathematical model and lower bounding techniques. 105054 - Herbert Jodlbauer, Matthias Dehmer:
An extension of the reorder point method by using advance demand spike information. 105055 - Thomas Ullmert, Stefan Ruzika, Anita Schöbel:
On the p-hub interdiction problem. 105056 - Everton Fernandes da Silva, Aline Aparecida de Souza Leão, Franklina Maria Bragion Toledo, Tony Wauters:
A matheuristic framework for the Three-dimensional Single Large Object Placement Problem with practical constraints. 105058
- Harry Aguilar, Alberto García-Villoria, Rafael Pastor:
A survey of the parallel assembly lines balancing problem. 105061
- Jonathan De La Vega, Pedro Munari, Reinaldo Morabito:
Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen. 105062 - Reinhard Bürgy, Alain Hertz, Pierre Baptiste:
An exact dynamic programming algorithm for the precedence-constrained class sequencing problem. 105063 - Ibrahim Kucukkoc:
Balancing of two-sided disassembly lines: Problem definition, MILP model and genetic algorithm approach. 105064 - Carlo S. Sartori, Luciana S. Buriol:
A study on the pickup and delivery problem with time windows: Matheuristics and new instances. 105065 - Herminia I. Calvete, Carmen Galé, José A. Iranzo, José-Fernando Camacho-Vallejo, Martha-Selene Casas-Ramírez:
A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences. 105066 - Tao Wu, Zhongshun Shi, Zhe Liang, Xiaoning Zhang, Canrong Zhang:
Dantzig-Wolfe decomposition for the facility location and production planning problem. 105068 - Zeynel Abidin Çil, Damla Kizilay:
Constraint programming model for multi-manned assembly line balancing problem. 105069 - Ming Chen, Zhi-Long Chen:
Optimal pricing to minimize maximum regret with limited demand information. 105070
- Jue Liu, Zhan Pang, Linggang Qi:
Dynamic pricing and inventory management with demand learning: A bayesian approach. 105078
- Bo Jin:
A note on "An exact algorithm for the blocks relocation problem with new lower bounds". 105082 - Tolga Bektas, Luís Gouveia, Daniel Santos:
Compact formulations for multi-depot routing problems: Theoretical and computational comparisons. 105084 - Minh Hoàng Hà, Tat Dat Nguyen, Thinh Nguyen Duy, Hoang Giang Pham, Thuy Do, Louis-Martin Rousseau:
A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints. 105085
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-11-08 20:19 CET 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:
