default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 113
Volume 113, January 2020
- Eduardo A. J. Anacleto
, Cláudio N. Meneses, Santiago Valdés Ravelo:
Closed-form formulas for evaluating r-flip moves to the unconstrained binary quadratic programming problem. - John Martinovic, Maxence Delorme, Manuel Iori, Guntram Scheithauer, Nico Strasdat:
Improved flow-based formulations for the skiving stock problem. - Simon Emde, Lukas Polten, Michel Gendreau:
Logic-based benders decomposition for scheduling a batching machine. - Rui Chen, Xinwu Qian, Lixin Miao, Satish V. Ukkusuri:
Optimal charging facility location and capacity for electric vehicles considering route choice and charging time equilibrium. - Carl Axel Folkestad, Nora Hansen, Kjetil Fagerholt, Henrik Andersson, Giovanni Pantuso:
Optimal charging and repositioning of electric vehicles in a free-floating carsharing system. - Arsham Atashi Khoei, Haldun Süral, Mustafa Kemal Tural:
Multi-facility green Weber problem. - Zhaohui Liu, Jiyuan Zhan:
Online fractional hierarchical scheduling on uniformly related machines. - Cheng-Hung Wu, Yi-Chun Yao, Stéphane Dauzère-Pérès, Cheng-Juei Yu:
Dynamic dispatching and preventive maintenance for parallel machines with dispatching-dependent deterioration. - Faisal Alkaabneh, Ali Diabat, Huaizhu Oliver Gao:
Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs. - Levi Ribeiro de Abreu, Jesus O. Cunha, Bruno A. Prata, Jose M. Framiñan:
A genetic algorithm for scheduling open shops with sequence-dependent setup times. - André Hottung, Shunji Tanaka, Kevin Tierney:
Deep learning assisted heuristic tree search for the container pre-marshalling problem. - Janniele A. S. Araujo, Haroldo G. Santos, Bernard Gendron, Sanjay Dominik Jena, Samuel S. Brito, Danilo S. Souza:
Strong bounds for resource constrained project scheduling: Preprocessing and cutting planes. - Lucas Kletzander, Nysret Musliu:
Solving the general employee scheduling problem. - Iliya Markov, Michel Bierlaire, Jean-François Cordeau, Yousef Maknoon, Sacha Varone:
Waste collection inventory routing with non-stationary stochastic demands. - Tommaso Adamo, Gianpaolo Ghiani, Emanuela Guerriero:
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem. - Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala:
Pickup and delivery problem with incompatibility constraints. - Rico Walter:
A note on "Workload smoothing in simple assembly line balancing". - Giusy Macrina, Luigi Di Puglia Pugliese, Francesca Guerriero, Gilbert Laporte:
Crowd-shipping with time windows and transshipment nodes. - Alina G. Dragomir, Karl F. Doerner:
Solution techniques for the inter-modal pickup and delivery problem in two regions.
- Stefan Poikonen, Bruce L. Golden:
Multi-visit drone routing problem.
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-12-22 19:04 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:
