default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputers & Operations Research, Volume 104
Volume 104, April 2019
- Brahim Chabane, Matthieu Basseur, Jin-Kao Hao
:
Lorenz dominance based algorithms to solve a practical multiobjective problem. 1-14 - Robert L. Burdett, Paul Corry, Prasad K. D. V. Yarlagadda, Colin Murray Eustace, Simon Smith:
A flexible job shop scheduling approach with operators for coal export terminals. 15-36 - Ming Liu, Feng Chu, Junkai He, Dapeng Yang, Chengbin Chu:
Coke production scheduling problem: A parallel machine scheduling with batch preprocessings and location-dependent processing times. 37-48 - Zhenxing Xu, Kun He, Chu-Min Li:
An iterative Path-Breaking approach with mutation and restart strategies for the MAX-SAT problem. 49-58 - Narcís Coll, Marta Fort, Joan Antoni Sellarès:
On the overlap area of a disk and a piecewise circular domain. 59-73 - Xiaoxuan Hu, Waiming Zhu, Bo An, Peng Jin, Wei Xia:
A branch and price algorithm for EOS constellation imaging and downloading integrated scheduling problem. 74-89 - Milagros Loreto, Y. Xu, David H. Kotval:
A numerical study of applying spectral-step subgradient method for solving nonsmooth unconstrained optimization problems. 90-97 - Yi-Hang Zhu, Túlio A. M. Toffolo, Wim Vancroonenburg, Greet Vanden Berghe:
Compatibility of short and long term objectives for dynamic patient admission scheduling. 98-112 - Hamza Ben Ticha, Nabil Absi, Dominique Feillet, Alain Quilliot:
Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows. 113-126 - Hassan Zohali, Bahman Naderi, Mohammad Mohammadi, Vahid Roshanaei:
Reformulation, linearization, and a hybrid iterated local search algorithm for economic lot-sizing and sequencing in hybrid flow shop problems. 127-138 - Vladimir L. Beresnev, Andrey A. Melnikov:
Approximation of the competitive facility location problem with MIPs. 139-148 - Jesus O. Cunha, Hugo Harry Kramer, Rafael A. Melo:
Effective matheuristics for the multi-item capacitated lot-sizing problem with remanufacturing. 149-158 - Shijin Wang, Benyan Ye:
Exact methods for order acceptance and scheduling on unrelated parallel machines. 159-173 - Alfredo Marín, Mercedes Pelegrín-García:
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. 174-190 - Alberto Franzin, Thomas Stützle:
Revisiting simulated annealing: A component-based analysis. 191-206 - Mahmood Maher Salih, B. B. Zaidan, A. A. Zaidan, Mohamed Aktham Ahmed:
Survey on fuzzy TOPSIS state-of-the-art between 2007 and 2017. 207-227 - André B. Chassein, Anika Kinscherff:
Complexity of strict robust integer minimum cost flow problems: An overview and further results. 228-238 - Jing-Rung Yu, Wan-Jiun Paul Chiou, Wen-Yi Lee, Tsao-Yuan Chuang:
Realized performance of robust portfolios: Worst-case Omega vs. CVaR-related models. 239-255 - Aurélien Froger, Jorge E. Mendoza, Ola Jabali, Gilbert Laporte:
Improved formulations and algorithmic components for the electric vehicle routing problem with nonlinear charging functions. 256-294 - Ana Dolores López-Sánchez, Jesús Sánchez-Oro, Alfredo García Hernández-Díaz:
GRASP and VNS for solving the p-next center problem. 295-303 - Lu Zhen, Shuaian Wang, Gilbert Laporte, Yi Hu:
Integrated planning of ship deployment, service schedule and container routing. 304-318 - Toni Ismael Wickert, Pieter Smet, Greet Vanden Berghe:
The nurse rerostering problem: Strategies for reconstructing disrupted schedules. 319-337 - Gerhard Rauchecker, Guido Schryen:
Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: Development and computational evaluation of a parallel branch-and-price algorithm. 338-357
- Milad Keshvari Fard, Laurent Alfandari:
Trade-offs between the stepwise cost function and its linear approximation for the modular hub location problem. 358-374 - Hamid Mokhtar, Mohan Krishnamoorthy, Andreas T. Ernst:
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems. 375-393 - Weibin Dai, Jun Zhang, Xiaoqian Sun, Sebastian Wandelt:
HUBBI: Iterative network design for incomplete hub location problems. 394-414 - Hamid Mokhtar, A. A. N. Perwira Redi, Mohan Krishnamoorthy, Andreas T. Ernst:
An intermodal hub location problem for container distribution in Indonesia. 415-432
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 2025-03-05 20:56 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:
