


default search action
Computers & Operations Research, Volume 149
Volume 149, January 2023
- Corinna Krebs, Jan Fabian Ehmke
, Henriette Koch:
Effective loading in combined vehicle routing and container loading problems. 105988 - Söhnke Maecker, Liji Shen, Lars Mönch:
Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness. 105999 - Jianjiang Wang
, Guopeng Song
, Zhe Liang, Erik Demeulemeester
, Xuejun Hu, Jin Liu:
Unrelated parallel machine scheduling with multiple time windows: An application to earth observation satellite scheduling. 106010 - Sinaide Nunes Bezerra
, Marcone Jamilson Freitas Souza
, Sérgio Ricardo de Souza
:
A variable neighborhood search-based algorithm with adaptive local search for the Vehicle Routing Problem with Time Windows and multi-depots aiming for vehicle fleet reduction. 106016 - Quoc Nhat Han Tran
, Nhan-Quy Nguyen, Farouk Yalaoui, Lionel Amodeo, Hicham Chehade:
Improved formulations and new valid inequalities for a Hybrid Flow Shop problem with time-varying resources and chaining time-lag. 106018 - Thibault Lechien
, Jorik Jooken
, Patrick De Causmaecker
:
Evolving test instances of the Hamiltonian completion problem. 106019 - Ryan O'Neil
, Abdelhakim Khatab
, Claver Diallo
, Uday Venkatadri:
Optimal joint maintenance and orienteering strategy for complex mission-oriented systems: A case study in offshore wind energy. 106020 - Harol Mauricio Gámez Albán
, Trijntje Cornelissens
, Kenneth Sörensen
:
Scattered storage assignment: Mathematical model and valid inequalities to optimize the intra-order item distances. 106022 - Seyed R. Mousavi
:
Exploiting flat subspaces in local search for p-Center problem and two fault-tolerant variants. 106023 - Paolo Fadda, Simona Mancini
, Patrizia Serra
, Gianfranco Fancello:
The Heterogeneous Fleet Vehicle Routing Problem with Draft Limits. 106024 - Paula Metzker
, Simon Thevenin, Yossiri Adulyasak, Alexandre Dolgui
:
Robust optimization for lot-sizing problems under yield uncertainty. 106025 - Ying Meng, Tianyang Li
, Lixin Tang:
Learning-based multi-objective evolutionary algorithm for batching decision problem. 106026 - Carmine Cerrone
, Davide Donato Russo
:
An exact reduction technique for the k-Colour Shortest Path Problem. 106027 - Beste Basciftci
, Xian Yu, Siqian Shen:
Resource distribution under spatiotemporal uncertainty of disease spread: Stochastic versus robust approaches. 106028 - Gabriel Volte, Eric Bourreau, Rodolphe Giroudeau, Olivier Naud
:
Using VRPSolver to efficiently solve the Differential Harvest Problem. 106029 - Ali Muffak
, Okan Arslan
:
A Benders decomposition algorithm for the maximum availability service facility location problem. 106030 - Cédric Joncour, Julien Kritter, Sophie Michel
, Xavier Schepler:
Generalized Relax-and-Fix heuristic. 106038 - Jie Zhang, Yanfeng Li:
Collaborative vehicle-drone distribution network optimization for perishable products in the epidemic situation. 106039 - Matheus Freitas, João Marcos Pereira Silva
, Eduardo Uchoa:
A unified exact approach for Clustered and Generalized Vehicle Routing Problems. 106040 - Maryam Haghi, Okan Arslan
, Gilbert Laporte:
A location-or-routing problem with partial and decaying coverage. 106041 - Yixuan Wang
, Nuo Wang, Peixiu Han
:
Maritime location inventory routing problem for island supply chain network under periodic freight demand. 106042 - Fabian Gnegel
, Armin Fügenschuh
:
Branch-and-refine for solving time-expanded MILP formulations. 106043 - Carlos Diego Rodrigues
, Adriana Cristina Cherri
, Silvio Alexandre de Araujo
:
Strip based compact formulation for two-dimensional guillotine cutting problems. 106044 - Haodong Liu, Huili Zhang, Kelin Luo
, Yao Xu
, Yinfeng Xu, Weitian Tong
:
Online generalized assignment problem with historical information. 106047

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.